Edge coloring of graphs, uses, limitation, complexity

Open access

Abstract

The known fact that coloring of the nodes of a graph improves the performance of practical clique search algorithm is the main motivation of this paper. We will describe a number of ways in which an edge coloring scheme proposed in [8] can be used in clique search. The edge coloring provides an upper bound for the clique number. This estimate has a limitation. It will be shown that the gap between the clique number and the upper bound can be arbitrarily large. Finally, it will be shown that to determine the optimal number of colors in an edge coloring is NP-hard.

[1] I. M. Bomze, M. Budinich, P. M. Pardalos, M. Pelillo, The Maximum Clique Problem, Handbook of Combinatorial Optimization Vol. 4, Kluwer Academic Publisher, 1999. ⇒64

[2] R. Carraghan, P. M. Pardalos, An exact algorithm for the maximum clique problem, Operation Research Letters 9 (1990), 375–382. ⇒67

[3] J. Hasselberg, P. M. Pardalos, and G. Vairaktarakis, Test case generators and computational results for the maximum clique problem, Journal of Global Optimization 3 (1993), 463–482. ⇒64

[4] D. Kumlander, Some Practical Algorithms to Solve the Maximal Clique problem PhD. Thesis, Tallin University of Technology, 2005. ⇒64

[5] C. Morgan, A Combinatorial Search with Dancing Links, PhD. Thesis, Univ. of Warwick, 1999–2000. ⇒64

[6] J. Mycielski, Sur le coloriage des graphes, Colloq. Math. 3 (1955), 161–162. ⇒70

[7] C. H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Inc., 1994. ⇒64, 74

[8] S. Szabó, Parallel algorithms for finding cliques in a graph, Journal of Physics: Conference Series 268 (2011) 012030 ⇒63, 65

Acta Universitatis Sapientiae, Informatica

The Journal of "Sapientia" Hungarian University of Transylvania

Journal Information

Metrics

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 104 104 17
PDF Downloads 27 27 6