Abstract
This paper concerns graph embedding under topological constraints. We address the problem of finding a planar embedding of a graph satisfying a set of constraints between its vertices and cycles that require embedding a given vertex inside its corresponding cycle. This problem turns out to be NP-complete. However, towards an analysis of its tractable subproblems, we develop an efficient algorithm for the special case where graphs are 2-connected and any two distinct cycles in the constraints have at most one vertex in common.
This work was supported by a DFG grant of the graduate school on human and machine intelligence.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Refrences
J. A. Bondy, U.S.R. Murty: Graph Theory with Applications, MacMillan, 1976
G. Demoucron, Y. Malgrange, R. Pertuiset: Graphes planaires: reconnaissance et construction de représentations planaires topologiques, Revue Française de Recherche Opérationelle, 8: 33–47, 1964
R. Diestel: Graph Theory, Springer, 1997
M. R. Garey, D. S. Johnson: Computers and Intractability-A Guide to the Theory of NP-Completeness, Freeman, 1979
W. He, K. Marriott: Constrained graph layout, in S. North (ed.), Graph Drawing, Proceedings of GD’96, LNCS 1190, 217–232, 1997
M. M. Syslo: An efficient cycle vector space algorithm for listing all cycles of a planar graph, SIAM Journal on Computing, 10,4: 797–808, 1981
R. Tamassia: Constraints in graph drawing algorithms, Constraints, 3: 87–120, 1998
C. Thomassen: Planarity and duality of finite and infinite graphs, Journal of Combinatorial Theory, Series B, 29: 244–271, 1980
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dornheim, C. (1999). Graph Embedding with Topological Cycle-Constraints. In: Kratochvíyl, J. (eds) Graph Drawing. GD 1999. Lecture Notes in Computer Science, vol 1731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46648-7_16
Download citation
DOI: https://doi.org/10.1007/3-540-46648-7_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66904-3
Online ISBN: 978-3-540-46648-2
eBook Packages: Springer Book Archive