Finding a Δ-regular supergraph of minimum order

Authors:
Hans L Bodlaender;Richard B Tan;Jan van Leeuwen
Affiliations:
Institute of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584 CH Utrecht, Netherlands;Institute of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584 CH Utrecht, Netherlands and Department of Computer Science, University of Sciences & Arts of Oklahoma, Chick ...;Institute of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584 CH Utrecht, Netherlands
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 1
Cited 2

An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Parameterized Graph Editing with Chosen Vertex Degrees

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Editing graphs to satisfy degree constraints: A parameterized approach

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.04

Visualization

Abstract

Akiyama et al. (Elem. Math. 83 (1983) 15) proved that every graph of maximum degree @D is a subgraph of a @D-regular graph that has at most @D+2 additional vertices. We show that, given a graph of maximum degree @D, a @D-regular supergraph of it of minimum order can be computed in O(min{@D^1^.^5|V|^2^.^5,@D^6+@D|V|}) time.