Crossing Number of Graphs with Rotation Systems

15 years 4 months ago

Download www.cdm.depaul.edu

We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, that computing the crossing number of a cubic graph (no rotation system) is NP-complete.

Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef

Real-time Traffic

Computer Graphics | GD 2007 | Rotation System | Simpler Proof |

claim paper

» Crossing Numbers of Graphs with Rotation Systems

» SingleCycle PlainWoven Objects

» Effective information visualisation a study of graph drawing aesthetics and algorithms

» Refinement of Orthogonal Graph Drawings

» Techniques for the Refinement of Orthogonal Graph Drawings

» On Optimal Concurrency Control for Optimistic Replication

» Face Identification by SIFTbased Complete Graph Topology

» A new dynamical layout algorithm for complex biochemical reaction networks

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	GD
Authors	Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic

Comments (0)

Sciweavers

Crossing Number of Graphs with Rotation Systems

Computer Graphics | GD 2007 | Rotation System | Simpler Proof |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers