Computing and Combinatorics
From MaRDI portal
Publication:5717002
DOI10.1007/11533719zbMath1128.05315OpenAlexW4376561447MaRDI QIDQ5717002
No author found.
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (5)
A Note on the Practicality of Maximal Planar Subgraph Algorithms ⋮ A branch-and-cut approach to the crossing number problem ⋮ Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions ⋮ Non-planar core reduction of graphs ⋮ Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem
This page was built for publication: Computing and Combinatorics
