Recognizing Partial Cubes in Quadratic Time
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(n^2), improving previous O(nm)-time solutions.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2007
- DOI:
- 10.48550/arXiv.0705.1025
- arXiv:
- arXiv:0705.1025
- Bibcode:
- 2007arXiv0705.1025E
- Keywords:
-
- Computer Science - Data Structures and Algorithms;
- F.2.2
- E-Print:
- 25 pages, five figures. This version significantly expands previous versions, including a new report on an implementation of the algorithm and experiments with it