STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Inducing regulation of any digraphs
Discrete Applied Mathematics
Hi-index | 0.00 |
Akiyama et al. (Elem. Math. 83 (1983) 15) proved that every graph of maximum degree Δ is a subgraph of a Δ-regular graph that has at most Δ + 2 additional vertices. We show that, given a graph of maximum degree Δ, a Δ-regular supergraph of it of minimum order can be computed in O(min {Δ1.5|V|2.5, Δ6 + Δ|V|}) time.