The Complexity of Several Realizability Problems for Abstract Topological Graphs

DOI10.1007/978-3-540-77537-9_16zbMATH Open1137.68498OpenAlexW1519234914MaRDI QIDQ5452218FDOQ5452218

Authors: 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

Recommendations

• Simple realizability of complete abstract topological graphs in P
• Simple realizability of complete abstract topological graphs simplified
• Simple realizability of complete abstract topological graphs simplified
• scientific article; zbMATH DE number 7030516
• On rectilinear topological graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) 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 representations (geometric and intersection representations, etc.) (05C62)

Cites Work

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

Cited In (3)

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

This page was built for publication: The Complexity of Several Realizability Problems for Abstract Topological Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452218)