Untangling planar graphs from a specified vertex position-Hard cases
DOI10.1016/J.DAM.2011.01.011zbMATH Open1219.05046OpenAlexW2012957023MaRDI QIDQ534342FDOQ534342
Oleg Pikhurko, M. Schacht, Mihyun Kang, Oleksandr Ravs'kyj, Oleg Verbitsky
Publication date: 17 May 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.01.011
Recommendations
- Untangling a planar graph
- Untangling a Planar Graph
- Upper bound constructions for untangling planar geometric graphs
- Upper Bound Constructions for Untangling Planar Geometric Graphs
- A polynomial bound for untangling geometric planar graphs
- A Polynomial Bound for Untangling Geometric Planar Graphs
- Planarizing graphs and their drawings by vertex splitting
- Publication:5753968
- scientific article; zbMATH DE number 437535
- The Vertex-Disjoint Menger Problem in Planar Graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- On the distribution of the length of the longest increasing subsequence of random permutations
- Concentration of measure and isoperimetric inequalities in product spaces
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- Untangling a planar graph
- On the length of the longest monotone subsequence in a random permutation
- The height of a random partial order: Concentration of measure
- Title not available (Why is that?)
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Title not available (Why is that?)
- Descending subsequences of random permutations
- A polynomial bound for untangling geometric planar graphs
- Untangling a polygon
- On Collinear Sets in Straight-Line Drawings
- Untangling a Planar Graph
- Moving Vertices to Make Drawings Plane
- Untangling polygons and graphs
- On the obfuscation complexity of planar graphs
Cited In (10)
- Untangling polygons and graphs
- Title not available (Why is that?)
- A polynomial bound for untangling geometric planar graphs
- Untangling a planar graph
- Every collinear set in a planar graph is free
- On Collinear Sets in Straight-Line Drawings
- Upper Bound Constructions for Untangling Planar Geometric Graphs
- Dual circumference and collinear sets
- Drawing Planar Graphs with Many Collinear Vertices
- Untangling circular drawings: algorithms and complexity
This page was built for publication: Untangling planar graphs from a specified vertex position-Hard cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534342)
