Improving a family of approximation algorithms to edge color multigraphs

Information Processing Letters

Volumn 68, Issue 1, 1998, Pages 11-15

  Caprara, Alberto ^a   Rizzi, Romeo ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

Approximation algorithm; Edge coloring; Matching

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; NUMERICAL METHODS; POLYNOMIALS;

APPROXIMATION ALGORITHM; EDGE COLOR MULTIGRAPH;

ALGORITHMS;

EID: 0039657123     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00138-0     Document Type: Article

References (14)

1. L. Andersen, On edge colorings of graphs, Math. Scand. 40 (1977) 161-175.
2. S. Fiorini, R.J. Wilson, Edge-Colouring of Graphs, Pitman, London, 1977.
3. H.N. Gabow, T. Nishizeki, O. Kariv, D. Leven, O. Terada, Algorithms for edge-coloring graphs, Technical Report TRECIS-8501, Tohoku University, 1985.
4. A.M.H. Gerards, Matching, in: M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser (Eds.), Handbook in Operations Research and Management Sciences, Volume Networks, 1995.
5. M.K. Goldberg, Edge-colorings of multigraphs: recoloring techniques, J. Graph Theory 8 (1984) 122-136.
6. D.S. Hochbaum, T. Nishizeki, D.B. Shmoys, A better than 'Best Possible' algorithm to edge color multigraphs, J. Algorithms 7 (1986) 79-104.
7. I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981) 718-720.
8. 1/2|E|) algorithm for finding maximum matchings in general graphs, in: Proc. 21th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, 1980, pp. 17-27.
9. T. Nishizeki, K. Kashiwagi, On the 1.1 edge-coloring of multigraphs, SIAM J. Discrete Math. 3 (1990) 391-410.
10. T. Nishizeki, M. Sato, An algorithm for edge-coloring multigraphs, Trans. Inst, of Electronics and Communication Eng. J67-D 4 (1984) 466-471 (in Japanese).
11. M.W. Padberg, L.A. Wolsey, Fractional covers for forests and matchings, Math. Programming 29 (1984) 1-14.
12. P.D. Seymour, On multi-colourings of cubic graphs, and conjectures of fulkerson and tutte, Proc. London Math. Soc., Ser. (3) 38 (1979) 423-460.
13. P.D. Seymour, Private communication.
14. V.G. Vizing, On an estimate of the chromatic class of a p-graph, Diskretetnyi Analiz 3 (1964) 25-30.