A Polynomial Bound for Untangling Geometric Planar Graphs

Discrete and Computational Geometry - United States
doi 10.1007/s00454-008-9125-3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2011English

Polynomial-Time Approximation Scheme for Minimum K-Cut in Planar and Minor-Free Graphs

2019English

Basic Algebro-Geometric Concepts in the Study of Planar Polynomial Vector Fields

Publicacions Matematiques
Mathematics
1997English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

Functional Equations for Planar Graphs

Physics Letters, Section B: Nuclear, Elementary Particle and High-Energy Physics
High Energy PhysicsNuclear
1981English

Planar and Non-Planar Graphs

International Journal of Modern Trends in Engineering & Research
2017English

Planar Graphs : A Historical Perspective.

English

Planar Lombardi Drawings for Subcubic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy