Recognizing Partial Cubes in Quadratic Time
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(n^2), improving previous O(nm)-time solutions.
- Pub Date:
- May 2007
- Computer Science - Data Structures and Algorithms;
- 25 pages, five figures. This version significantly expands previous versions, including a new report on an implementation of the algorithm and experiments with it