Recognizing Partial Cubes in Quadratic Time
Data Structures and Algorithms
2011-07-21 v2
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.
Cite
@article{arxiv.0705.1025,
title = {Recognizing Partial Cubes in Quadratic Time},
author = {David Eppstein},
journal= {arXiv preprint arXiv:0705.1025},
year = {2011}
}