Recognizing partial cubes in quadratic time

Authors:
David Eppstein
Affiliations:
University of California, Irvine
Venue:
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2008

Citing 8
Cited 2

Recognizing median graphs in subquadratic time

Theoretical Computer Science
Median Graphs and Triangle-Free Graphs

SIAM Journal on Discrete Mathematics
Center and diameter problems in plane triangulations and quadrangulations

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Knowledge Spaces

Knowledge Spaces
Media theory

Discrete Applied Mathematics
Fast recognition algorithms for classes of partial cubes

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
The lattice dimension of a graph

European Journal of Combinatorics
Algorithms for drawing media

GD'04 Proceedings of the 12th international conference on Graph Drawing

Isometric Diamond Subgraphs

Graph Drawing
Convex Excess in Partial Cubes

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to test whether a graph with n vertices and m edges is a partial cube, and if so how to find a distance-preserving embedding of the graph into a hypercube, in the near-optimal time bound O(n2), improving previous O(nm)-time solutions.