Reconstruction of planar graphs from their centered triangulations in some spatio-relational models

Ágnes B. Novák, Z. Tuza

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper we continue the investigation of an interoperability problem and its complexity in connection with spatio-relational database models. The result, however, is also interesting from the point of view of graph theory, since the main result is that there is a linear-time algorithm for deciding wether a given triangulation can be seen as a centered triangulation of a certain planar graph.

Original languageEnglish
Title of host publicationICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Proceedings
Pages181-185
Number of pages5
Volume2005
DOIs
Publication statusPublished - 2005
EventICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Mauritius, Mauritius
Duration: Apr 13 2005Apr 16 2005

Other

OtherICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics
CountryMauritius
CityMauritius
Period4/13/054/16/05

Fingerprint

Triangulation
Graph theory
Interoperability

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Novák, Á. B., & Tuza, Z. (2005). Reconstruction of planar graphs from their centered triangulations in some spatio-relational models. In ICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Proceedings (Vol. 2005, pp. 181-185). [1511570] https://doi.org/10.1109/ICCCYB.2005.1511570

Reconstruction of planar graphs from their centered triangulations in some spatio-relational models. / Novák, Ágnes B.; Tuza, Z.

ICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Proceedings. Vol. 2005 2005. p. 181-185 1511570.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Novák, ÁB & Tuza, Z 2005, Reconstruction of planar graphs from their centered triangulations in some spatio-relational models. in ICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Proceedings. vol. 2005, 1511570, pp. 181-185, ICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics, Mauritius, Mauritius, 4/13/05. https://doi.org/10.1109/ICCCYB.2005.1511570
Novák ÁB, Tuza Z. Reconstruction of planar graphs from their centered triangulations in some spatio-relational models. In ICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Proceedings. Vol. 2005. 2005. p. 181-185. 1511570 https://doi.org/10.1109/ICCCYB.2005.1511570
Novák, Ágnes B. ; Tuza, Z. / Reconstruction of planar graphs from their centered triangulations in some spatio-relational models. ICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Proceedings. Vol. 2005 2005. pp. 181-185
@inproceedings{4387f33426644ff6b13679d8ca8c41c0,
title = "Reconstruction of planar graphs from their centered triangulations in some spatio-relational models",
abstract = "In this paper we continue the investigation of an interoperability problem and its complexity in connection with spatio-relational database models. The result, however, is also interesting from the point of view of graph theory, since the main result is that there is a linear-time algorithm for deciding wether a given triangulation can be seen as a centered triangulation of a certain planar graph.",
author = "Nov{\'a}k, {{\'A}gnes B.} and Z. Tuza",
year = "2005",
doi = "10.1109/ICCCYB.2005.1511570",
language = "English",
isbn = "0780391225",
volume = "2005",
pages = "181--185",
booktitle = "ICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Proceedings",

}

TY - GEN

T1 - Reconstruction of planar graphs from their centered triangulations in some spatio-relational models

AU - Novák, Ágnes B.

AU - Tuza, Z.

PY - 2005

Y1 - 2005

N2 - In this paper we continue the investigation of an interoperability problem and its complexity in connection with spatio-relational database models. The result, however, is also interesting from the point of view of graph theory, since the main result is that there is a linear-time algorithm for deciding wether a given triangulation can be seen as a centered triangulation of a certain planar graph.

AB - In this paper we continue the investigation of an interoperability problem and its complexity in connection with spatio-relational database models. The result, however, is also interesting from the point of view of graph theory, since the main result is that there is a linear-time algorithm for deciding wether a given triangulation can be seen as a centered triangulation of a certain planar graph.

UR - http://www.scopus.com/inward/record.url?scp=33749041441&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749041441&partnerID=8YFLogxK

U2 - 10.1109/ICCCYB.2005.1511570

DO - 10.1109/ICCCYB.2005.1511570

M3 - Conference contribution

SN - 0780391225

SN - 9780780391222

VL - 2005

SP - 181

EP - 185

BT - ICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Proceedings

ER -