Linear-time certifying algorithms for near-graphical sequences

Discrete Mathematics

Volumn 309, Issue 18, 2009, Pages 5703-5713

  Hell, Pavol ^a   Kirkpatrick, David ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

(g, f) factor; Certifying algorithm; Degree sequence; f factor; Graph factor; Graphical sequence

Indexed keywords

(G, F)-FACTOR; CERTIFYING ALGORITHM; DEGREE SEQUENCE; F-FACTOR; GRAPH FACTOR; GRAPHICAL SEQUENCE;

ALGORITHMS; CHARACTERIZATION;

GRAPH THEORY;

EID: 69549110313     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2008.05.005     Document Type: Article

References (27)

1. Anstee R. An algorithmic proof of Tutte's f-factor theorem. J. Algorithms 6 (1985) 112-131
2. Anstee R. Simplified existence theorems for (g, f)-factors. Discrete Appl. Math. 27 (1990) 29-38
3. Arikati S., and Maheshwari A. Realizing degree sequences in parallel. SIAM J. Discrete Math. 9 2 (1996) 317-338
4. Asano T. Graphical degree sequence problems with connectivity requirements. Proc. 4th ISAAC. LNCS vol. 762 (1993) 38-47
5. Belck H.B. Regulare factoren von graphen. J. Reine Angew. Math. 188 (1950) 228-252
6. Berge C. Two theorems in graph theory. Proc. Natl. Acad. Sci. USA 43 (1957) 842-844
7. Berge C. Sur le couplage maximum d'un graphe. C. R. Acad. Sci. Paris 247 (1958) 258-259
8. Berge C. Graphs and Hypergraphs (1973), North Holland
9. Erdös P., and Gallai T. Graphs with prescribed degrees of vertices. Mat. Lapok 11 (1960) 264-272
10. H.N. Gabow, An efficient reduction technique for degree constrained subgraphs and bidirected network flow problems, in: Proc. 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 448-456
11. Gale D. A theorem on flows in networks. Pacific J. Math. 7 (1957) 1073-1082
12. Hakimi S.L. On the realizability of a set of integers as the degrees of the vertices of a linear graph. SIAM J. Appl. Math. 10 (1962) 496-506
13. Harary F. Graph Theory (1969), Addison-Wesley
14. Havel V. Eine Bemerkung uber die Existenz der endlichen Graphen. Casopis Pest. Mat. 80 (1955) 477-480
15. Hell P., and Kirkpatrick D.G. Algorithms for degree constrained graph factors of minimum deficiency. J. Algorithms 14 (1993) 115-138
16. P. Hell, D.G. Kirkpatrick, A greedy [g, f]-factor algorithm for complete and complete bipartite graphs, Technical Report CSS/LCCR TR 94-09 (June 1994), Centre for System Science, Simon Fraser University, Burnaby, B. C., Canada
17. Lovasz L. Subgraphs with prescribed valencies. J. Combin. Theory 8 (1970) 391-416
18. Lovasz L., and Plummer M.D. Matching Theory (1986), North Holland
19. Mehlhorn K., and Näher S. The LEDA Platform for Combinatorial and Geometric Computing (1999), Cambridge University Press
20. M. Mihail, N. Vishnoi, On Generating Graphs with Prescribed Degree Sequences for Complex Network Modeling Applications, in: Proc. 3rd Workshop on Approximation and Randomized Algorithms for Communication Networks, Rome, Italy, September 2002
21. Ryser H.J. Matrices of zeros and ones. Bull. Amer. Math. Soc. 66 (1960) 442-464
22. Shiloach Y. Another look at the degree constrained subgraph problem. Inform. Process. Lett. 12 (1981) 89-92
23. Takahashi M., Imai K., and Asano T. Graphical degree sequence problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E77-A 3 (1994) 546-552
24. Tutte W.T. The factorization of linear graphs. J. London Math. Soc. 22 (1947) 107-111
25. Tutte W.T. The factors of graphs. Canad. J. Math. 4 (1952) 314-328
26. Tutte W.T. Graph factors. Combinatorica 1 (1981) 79-97
27. Wasserman H., and Blum M. Software reliability via run-time result-checking. J. ACM 44 (1997) 826-849