Rounding in symmetric matrices and undirected graphs

Discrete Applied Mathematics

Volumn 70, Issue 1, 1996, Pages 1-21

  Hell, Pavol ^a   Kirkpatrick, David ^b   Li, Brenda ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c NONE

Author keywords

Algorithms; Controlled rounding; Graph factors; Graphs; Matrix; Np complete; Rounding

Indexed keywords

EID: 0042038223     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(96)81476-4     Document Type: Article

References (22)

1. R.P. Anstee, An algorithmic proof of Tutte's f-factor theorem, J. Algorithms 6 (1985) 112-131.
2. R.P. Anstee, Simplified existence theorems for (g, f)-factors, Discrete Appl. Math. 27 (1990) 29-38.
3. R.P. Anstee, Dividing a graph by degrees, unpublished manuscript.
4. Z. Bárányai, On the factorization of the complete uniform hypergraph, in: A. Hajnal, ed., Colloq. Math. Soc. Janos Bolyai, Vol. 10, Infinite and finite sets (Bolyai, North Holland, Budapest, 1975) 91-108.
5. B. Causey, Approaches to statistical disclosure, Proceedings of the Social Statistics Section, Amer. Stat. Assoc., Washington, D.C. (1979) 306-309.
6. B. Causey, L.H. Cox and L.R. Ernst, Applications of transportation theory to statistical problems, J. Amer. Statist. Assoc. 80 (1985) 903-909.
7. L.H. Cox and L.R. Ernst, Controlled rounding, Informes 20 (4) (1982) 423-432.
8. I. Fellegi, Controlled random rounding, Statist. Canada Survey Methodology 1 (1975) 123-135.
9. H.N. Gabow, An efficient reduction technique for degree constrained subgraphs and bidirected network flow problems, Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, 448-456.
10. D. Gale, A theorem on flows in networks, Pacific J. Math. 7 (1957) 1073-1082.
11. M. Garey and D.S. Johnson, Computers and Intractability (Freeman, San Francisco, 1979).
12. S.L. Hakimi, On the readability of a set of integers as degrees of the vertices of a linear graph, J. SIAM Appl. Math. 10 (1962) 496-506.
13. V. Havel, A remark on the existence of finite graphs, Časopis Pěst. Mat. 80 (1955) 477-480.
14. P. Hell and D.G. Kirkpatrick, Factors and flows, TR 86-22, Department of Computer Science, University of British Columbia, Vancouver, BC (1986).
15. P. Hell and D.G. Kirkpatrick, Algorithms for degree constrained graph factors of minimum deficiency, J. Algorithms 14 (1993) 115-138.
16. P. Hell and D.G. Kirkpatrick, A greedy (g, f)-factor algorithm for complete and complete bipartite graphs", CSS/LCCR Technical Report TR94-09, Simon Fraser University, Burnaby, BC, Canada.
17. I. Holyer, The NP-completeness of some edge partition problems, SIAM J. Comput. 10 (1981) 713-717.
18. D.E. Knuth, Two-way rounding, SIAM J. Discrete Math. 8 (1995) 281-290.
19. B. Li, Graph theoretic controlled rounding, M.Sc. Thesis, Simon Fraser University (1986).
20. L. Lovász, Combinatorial Problems and Exercises (North Holland, New York, 1979).
21. L. Lovász and M.D. Plummer, Matching Theory, (North Holland, Amsterdam, 1986).
22. H.J. Ryser, Matrices of zeros and ones, Bull. Amer. Math. Soc. 66 (1960) 442-464.