Work

Recognizing Partial Cubes in Quadratic Time

Year: 2007

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.0705.1025

Author: Eppstein, David

Institution: University of California, Irvine

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Multidisciplinary University Research Initiative, Office of Naval Research

Awards: Collaborative Research: Algorithms for Graphs on Surfaces, G2998923865, G4154686922, G8876996369

OpenAlex ID: W2016084255

Cites: 32

Cited by: 15

Related to: 20