Recognizing Partial Cubes in Quadratic Time

Details Recognizing Partial Cubes in Quadratic Time Recognizing Partial Cubes in Quadratic Time

2007-05-08

arxiv.org/abs/0705.1025v2

Journal of Graph Algorithms and Applications 15(2) 269-293, 2011

Computer Science

Data Structures and Algorithms

25 pages, five figures. This version significantly expands previous versions, including a new report on an implementation of t

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Recognizing Partial Cubes in Quadratic Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Recognizing Partial Cubes in Quadratic Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recognizing Partial Cubes in Quadratic Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-153229