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

Ágnes B. Novák, Zsolt 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
DOIs
Publication statusPublished - Dec 1 2005
EventICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Mauritius, Mauritius
Duration: Apr 13 2005Apr 16 2005

Publication series

NameICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Proceedings
Volume2005

Other

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

    Fingerprint

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 (pp. 181-185). [1511570] (ICCC 2005 - IEEE 3rd International Conference on Computational Cybernetics - Proceedings; Vol. 2005). https://doi.org/10.1109/ICCCYB.2005.1511570