The Complexity of Several Realizability Problems for Abstract Topological Graphs

DOI10.1007/978-3-540-77537-9_16zbMath1137.68498OpenAlexW1519234914MaRDI QIDQ5452218

Jan Kynčl

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Recent Advances in Exact Crossing Minimization (Extended Abstract) ⋮ Simple realizability of complete abstract topological graphs in P

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for drawing a planar graph on a grid
• On the crossing number of complete graphs
• String graphs. II: Recognizing string graphs is NP-hard
• String graphs. I: The number of critical nonstring graphs is infinite
• String graphs requiring exponential representations
• A special planar satisfiability problem and a consequence of its NP- completeness
• Unavoidable configurations in complete topological graphs
• Recognizing string graphs is decidable
• Decidability of string graphs
• Noncrossing Subgraphs in Topological Layouts
• Simultaneous Graph Embeddings with Fixed Edges
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• Graph Drawing
• Graph Drawing
• Enumeration of simple complete topological graphs
• Recognizing string graphs in NP