Recognizing partial cubes in quadratic time

MaRDI QIDQ3579509zbMATH OpenFDO

Authors David Eppstein

Publication date 6 August 2010

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Fast recognition algorithms for classes of partial cubes
• scientific article; zbMATH DE number 1998298
• Partial cubes: Structures, characterizations, and constructions
• Recognizing halved cubes in a constant time per edge
• Partial cubes are distance graphs

Cited in

(9)

• Fast recognition algorithms for classes of partial cubes
• On tope graphs of complexes of oriented matroids
• Omega polynomial in nanostructures
• Isometric Diamond Subgraphs
• Labeled sample compression schemes for complexes of oriented matroids
• Generalized Fibonacci cubes
• Characterizing almost-median graphs. II.
• Partial cubes and Fibonacci dimension: insights and perspectives
• Two-dimensional partial cubes

This page was built for publication: Recognizing partial cubes in quadratic time

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