Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm

PLoS ONE

Volumn 8, Issue 1, 2013, Pages

  Martín H , José Antonio ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; ASYMPTOMATIC PARAMETRIC EXACT 3 COLORING ALGORITHM; CONTROLLED STUDY; ERDOS RENYI CONNECTED RANDOM GRAPH; EXPERIMENTAL DESIGN; MATHEMATICAL ANALYSIS; MATHEMATICAL MODEL; PARAMETRIC TEST; PROBABILITY; PROBLEM SOLVING; PSEUDO RANDOM PLANAR GRAPH; RANDOM 4 REGULAR PLANAR GRAPH; STATISTICAL DISTRIBUTION;

ALGORITHMS; COLOR; COMPUTER GRAPHICS; STATISTICS AS TOPIC; TIME FACTORS;

EID: 84872341102     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0053437     Document Type: Article

References (60)

1. Jones M (2008) Arti_cial Intelligence: A Systems Approach. Computer Science. Jones & Bartlett Publishers, Incorporated.
2. Wigderson A, (1983) Improving the performance guarantee for approximate graph coloring. Journal of the ACM (JACM) 30: 729-735.
3. Park T, Lee C, (1996) Application of the graph coloring algorithm to the frequency assignment problem. Journal of the Operations Research Society of Japan-Keiei Kagaku 39: 258-265.
4. Ramani A, Aloul F, Markov I, Sakallah K (2004) Breaking instance-independent symmetries in exact graph coloring. In: Proceedings of the conference on Design, automation and test in Europe-Volume 1. IEEE Computer Society, p. 10324.
5. Zdeborová L, Krzakala F, (2007) Phase transitions in the coloring of random graphs. Physical Review E 76: 031131.
6. Abfalter I (2005) Nucleic acid sequence design as a graph colouring problem. Ph.D. thesis, Universität Wien, Theoretical Biochemistry Group, Institute for Theoretical Chemistry website. Available: http://www.tbi.univie.ac.at/papers/Abstracts/ingrid diss.pdf. Accessed 2012 Dec 02.
7. Pevzner P, Waterman M (1995) Open combinatorial problems in computational molecular biology. In: Theory of Computing and Systems, 1995. Proceedings., Third Israel Symposium on the. IEEE, 158-173.
8. Karp R, (2011) Heuristic algorithms in computational molecular biology. Journal of Computer and System Sciences 77: 122-128.
9. Arora S, Barak B (2009) Computational Complexity: A Modern Approach. New York, NY, USA: Cambridge University Press, 1st edition.
10. Goldreich O (2008) Computational complexity: a conceptual perspective. Cambridge University Press.
11. Cook SA (1971) The complexity of theorem-proving procedures. In: Proceedings of the third annual ACM symposium on Theory of computing. New York, NY, USA: ACM, STOC '71, 151-158. doi:10.1145/800157.805047.
12. Karp RM (1972) Reducibility among combinational problems. Complexity of Computer Computations: 85-103.
13. Levin L, (1973) Universal sequential search problems. Problemy Peredachi Informatsii 9: 115-116.
14. Garey MR, Johnson DS (1979) Computers and Intractability, A Guide to the Theory of NPCompleteness. San Francisco: W.H. Freeman and Co.
15. Steinberg R, (1993) The state of the three color problem. Annals of discrete mathematics 55: 211-248.
16. Hogg T, Huberman B, Williams C, (1996) Phase transitions and the search problem. Artificial intelligence 81: 1-15.
17. Culberson J, Gent I, (2001) Frozen development in graph coloring. Theoretical computer science 265: 227-264.
18. Mulet R, Pagnani A, Weigt M, Zecchina R, (2002) Coloring random graphs. Physical review letters 89: 268701.
19. Boettcher S, Percus AG, (2004) Extremal optimization at the phase transition of the three-coloring problem. Physical Review E 69: 066703.
20. Erdo{double acute}s P, Rënyi A (1960) On the evolution of random graphs. Publications of tke Matkemafical Insfifufe of the Hungarian Academy of Sciences 5.
21. Erdos P, Kleitman D, Rothschild B (1976) Asymptotic enumeration of kn-free graphs. In: Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973). Atti dei Convegni Lincei, 17, Accad. Naz. Lincei, Roma, volume 2, 19-27.
22. Borodin OV, (1996) Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. Journal of Graph Theory 21: 183-186.
23. Borodin OV, Glebov A, Raspaud A, Salavatipour M, (2005) Planar graphs without cycles of length from 4 to 7 are 3-colorable. Journal of Combinatorial Theory, Series B 93: 303-311.
24. Wang Wf, Chen M, (2007) Planar graphs without 4,6,8-cycles are 3-colorable. Science in China Series A: Mathematics 50: 1552-1562.
25. Borodin OV, Glebov AN, Montassier M, Raspaud A, (2009) Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. Journal of Combinatorial Theory, Series B 99: 668-673.
26. Thomassen C, (1994) Gro{double acute}tzsch's 3-color theorem and its counterparts for the torus and the projective plane. Journal of Combinatorial Theory, Series B 62: 268-279.
27. Johnson DS, (1974) Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9: 256-278.
28. Johnson DS (1974) Worst case behavior of graph coloring algorithms. In: Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla, eds.). 513-527.
29. Garey MR, Johnson DS, (1976) The complexity of near-optimal graph coloring. Journal of the ACM (JACM) 23: 43-49.
30. Berger B, Rompel J, (1990) A better performance guarantee for approximate graph coloring. Algorithmica 5: 459-466.
31. Halldórsson M, (1993) A still better performance guarantee for approximate graph coloring. Information Processing Letters 45: 19-23.
32. Blum A, (1994) New approximation algorithms for graph coloring. Journal of the ACM (JACM) 41: 516.
33. Arora S, Chlamtac E (2006) New approximation guarantee for chromatic number. In: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. New York, NY, USA: ACM, STOC '06, 215-224. doi:10.1145/1132516.1132548.
34. Karger D, Motwani R, Sudan M, (1998) Approximate graph coloring by semidefinite programming. Journal of the ACM (JACM) 45: 246-265.
35. Khanna S, Linial N, Safra S, (2000) On the hardness of approximating the chromatic number. Combinatorica 20: 393-415.
36. Downey R, Fellows M (1999) Parameterized complexity, volume 5. Springer New York.
37. Flum J, Grohe M (2006). Parameterized complexity theory (texts in theoretical computer science. an eatcs series).
38. Boppana RB, Hastad J, Zachos S, (1987) Does co-NP have short interactive proofs? Information Processing Letters 25: 127-132.
39. Fortnow L, Sipser M, (1988) Are there interactive proofs for co-NP languages? Information Processing Letters 28: 249-251.
40. Bes JN, Jegou P (2005) Proving graph un-colorability with a consistency check of CSP. In: Tools with Artificial Intelligence, 2005. ICTAI 05. 17th IEEE International Conference on. 2 -694. doi:10.1109/ICTAI.2005.102.
41. Denise A, Vasconcellos M, Welsh D (1996) The random planar graph. Congressus numerantium: 61-80.
42. Bodirsky M, Gro{double acute}pl C, Kang M (2003) Generating labeled planar graphs uniformly at random. Automata, Languages and Programming: 191-191.
43. Manca P, (1979) Generating all planer graphs regular of degree four. Journal of graph theory 3: 357-364.
44. Lehel J, (1981) Generating all 4-regular planar graphs from the graph of the octahedron. Journal of graph theory 5: 423-426.
45. Broersma H, Duijvestijn A, Go{double acute}bel F, (1993) Generating all 3-connected 4-regular planar graphs from the octahedron graph. Journal of graph theory 17: 613-620.
46. Jensen TR, Toft B (1995) Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. Chichester-New York-Brisbane-Toronto-Singapore: John Wiley & Sons, XIX, 295 pp.
47. Chartrand G, Zhang P (2008) Chromatic Graph Theory. Chapman & Hall/CRC, 1st edition.
48. Stockmeyer L, (1973) Planar 3-colorability is polynomial complete. SIGACT News 5: 19-25.
49. Martin H JA (2011) Minimal non-extensible precolorings and implicit-relations. CoRR - Computing Research Repository abs/1104.0510.
50. Heawood P, (1898) On the four-colour map theorem. Quarterly Journal of Pure and Applied Mathematics 29: 270-285.
51. Johnson DS (2002) A theoreticians guide to the experimental analysis of algorithms. In: Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges. American Mathematical Society, 215-250.
52. Selman B, Mitchell D, Levesque H, (1996) Generating hard satisfiability problems* 1. Artificial intelligence 81: 17-29.
53. Mizuno K, Nishihara S, (2008) Constructive generation of very hard 3-colorability instances. Discrete Applied Mathematics 156: 218-229.
54. Appel K, Haken W, Koch J, (1977) Every planar map is four colorable. Part I: Discharging. Illinois Journal of Mathematics 21: 429-490.
55. Appel K, Haken W, Koch J, (1977) Every planar map is four colorable. Part II: Reducibility. Illinois Journal of Mathematics 21: 491-567.
56. Dailey DP, (1980) Uniqueness of colorability and colorability of planar 4-regular graphs are npcomplete. Discrete Mathematics 30: 289-293.
57. Malaguti E, Toth P, (2010) A survey on vertex coloring problems. International Transactions in Operational Research 17: 1-34.
58. Hochstättler W, Schliep A (2010) CATBox: An Interactive Course in Combinatorial Optimization. Springer, 1st, softcover edition, 190 pp. doi:10.1007/978-3-642-03822-8.
59. van Rossum G, et al. (2012) Python language website. Available: www.python.org.
60. Boyer J, Myrvold W, (2004) On the cutting edge: Simplified O(n) planarity by edge addition. Journal of Graph Algorithms and Applications 8: 241-273.