Efficient Planarity Testing

Cited In (only showing first 100 items - show all)

Computing the flip distance between triangulations
Determining outerplanarity using segment graphs
Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs
Constructing compact rectilinear planar layouts using canonical representation of planar graphs
Projective plan and Möbius band obstructions
Depth First Search in the Semi-streaming Model
SPLITTING NUMBER is NP-complete
Graph graphics: Theory and practice
Menus of kuratowski subgraphs
A direct linear-time planarity test for unflippable modules
A matrix analysis of carrier posets of biconnected graphs
Canonical forms for cycles in bridge graphs
Algorithms for Drawing Planar p-petal Graphs
A very personal reminiscence on the problem of computational complexity
Facilities layout generalized model solved by n-boundary shortest path heuristics
Parameterized complexity of the spanning tree congestion problem
Simple planar graph partition into three forests
$A\,V^ 2$ algorithm for determining isomorphism of planar graphs
A genetic algorithm for determining the thickness of a graph
An algorithm for the characterization of the nonplanarity of a maximal graphical partition
A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
Parameterized graph cleaning problems
Approximation algorithms for polynomial-expansion and low-density graphs
Reconstruction graphs and testing their properties in a relational spatial database
Upward planar morphs
Computational study on a PTAS for planar dominating set problem
An algorithm for reliability analysis of planar graphs
Searching forK_3,3in linear time
A simple algorithm for 4-coloring 3-colorable planar graphs
Approximating the rectilinear crossing number
Title not available (Why is that?)
Establishing order in planar subdivisions
HV-planarity: algorithms and complexity
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
Researches of semigroups with planar Cayley graphs: results and problems
Analogies between the crossing number and the tangle crossing number
Simpler algorithms for testing two-page book embedding of partitioned graphs
The two basic linear time Planarity algorithms: Are they the same?
Capacitated domination: problem complexity and approximation algorithms
On Boolean characterizations of planarity and planar embeddings of graphs
Branch-and-bound techniques for the maximum planar subgraph problem^∗
Radial level planarity with fixed embedding
A simulated annealing algorithm for determining the thickness of a graph
DFS tree construction: Algorithms and characterizations
Bijective comparison of optimal planarity algorithms
Approximating the rectilinear crossing number
The complexity of finding minimal Voronoi covers with applications to machine learning
The thickness of a minor-excluded class of graphs
Algorithms
Some problems in topological graph theory
Non-planar core reduction of graphs
Every triangle-free planar graph has a planar upward drawing
Line directionality of orders
The hybrid spanning tree problem
Algorithmic graph embeddings
Sewing ribbons on graphs in space
Linearizing partial search orders
Listing all spanning trees in Halin graphs -- sequential and parallel view
2-restricted extensions of partial embeddings of graphs
Testing planarity of geometric automorphisms in linear time
Improved planarity algorithms
Data Structures and their Planar Graph Layouts
Linear-time recognition of map graphs with outerplanar witness
On counting planar embeddings
Gap strings and spanning forests for bridge graphs of biconnected graphs
A simple recognition of maximal planar graphs
The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
Parameterized Graph Cleaning Problems
Clustered planarity testing revisited
Finding the closed partition of a planar graph
A method of graph reduction and its applications
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
Vertex-edge domination in unit disk graphs
Title not available (Why is that?)
Ranking and unranking planar embeddings
Coloring algorithms for $K_ 5$-minor free graphs
Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
The existence of homeomorphic subgraphs in chordal graphs
Desert island theorems
Upward planarity testing in practice: SAT formulations and comparative study
Planarity testing in parallel
Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
Enumeration of articulation pairs of a planar graph
Planar median graphs and cubesquare-graphs
Embedding graphs into embedded graphs
An algebra for pomsets.
A dichotomy result for cyclic-order traversing games
Planar rectilinear drawings of outerplanar graphs in linear time
Quantitative restrictions on crossing patterns
$k$-planar graphs
Indexing graph search trees and applications
Planar lattices are lexicographically shellable
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class
Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
Dynamic planar embeddings of dynamic graphs
Solides non organisés : définition, implantation et plongement
A large set of torus obstructions and how they were discovered
Title not available (Why is that?)
An efficient parallel algorithm for computing a large independent set in a planar graph

This page was built for publication: Efficient Planarity Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4065028)