Crossing Number of Graphs with Rotation Systems
DOI10.1007/978-3-540-77537-9_3zbMATH Open1137.68501OpenAlexW1599261767MaRDI QIDQ5452204FDOQ5452204
Authors: Michael J. Pelsmajer, Marcus Schaefer, D. Štefankovič 
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_3
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Crossing Number is NP-Complete
- On a cyclic string-to-string correction problem
- Crossing number is hard for cubic graphs
- An Extension of the String-to-String Correction Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Removing independently even crossings
- Minor-monotone crossing number
- Bimodal Crossing Minimization
- Title not available (Why is that?)
- Graph Drawing
Cited In (9)
- Crossing numbers of graphs with rotation systems
- The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2004
- Unexpected behaviour of crossing sequences
- Crossing number is hard for cubic graphs
- The crossing number of twisted graphs
- Crossing Number is NP-Complete
- Title not available (Why is that?)
This page was built for publication: Crossing Number of Graphs with Rotation Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452204)
