Abstract
The graph 3-colorability problem is a decision problem in graph theory which asks if it is possible to assign a color to each vertex of a given graph using at most three colors, satisfying the condition that every two adjacent vertices have different colors. It has been proved that the graph 3-colorability problem belongs to NP-complete class of problems which no polynomial resources solution is found for them yet.
In this paper, a novel optical solution to the graph 3-colorability problem is provided. In this solution, polynomial number of black filters are created in preprocessing phase each of which has exponential size and requires exponential time to be created. After preprocessing phase, the provided solution takes O(nā+ām) time to decide if a given graph is 3-colorable or not, where the given graph has n vertices and m edges.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Myszkowski, P.B.: Solving scheduling problems by evolutionary algorithms for graph coloring problem. SCI, vol.Ā 128, pp. 145ā167 (2008)
Zweben, M., Fox, M.: Intelligent Scheduling. Morgan Kaufmann, San Francisco (1998)
Goliaei, S., Jalili, S.: An optical wavelength-based solution to the 3-SAT problem. In: Dolev, S., Oltean, M. (eds.) OSC 2009. LNCS, vol.Ā 5882, pp. 77ā85. Springer, Heidelberg (2009)
Oltean, M.: Solving the hamiltonian path problem with a light-based computer. Natural Computing: an International JournalĀ 7(1), 57ā70 (2008)
Oltean, M., Muntean, O.: Exact cover with light. New Generation ComputingĀ 26(4), 327ā344 (2008)
Oltean, M., Muntean, O.: Solving the subset-sum problem with a light-based device. Natural Computing: an International JournalĀ 8(2), 321ā331 (2009)
Dolev, S., Fitoussi, H.: Masking traveling beams:optical solutions for np-complete problems, trading space for time. Theoretical Computer ScienceĀ 411, 837ā853 (2010)
Lin, M.: 3d dna self-assembly model for graph vertex coloring. Journal of Computational and Theoretical NanoscienceĀ 7(1), 246ā253 (2010)
DHondt, E.: Quantum approaches to graph colouring. Theoretical Computer ScienceĀ 410(4-5), 302ā309 (2009)
Goldreich, O.: Computational Complexity: a conceptual perspective. Cambridge University Press, Cambridge (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goliaei, S., Jalili, S. (2011). Optical Graph 3-Colorability. In: Dolev, S., Oltean, M. (eds) Optical Supercomputing. OSC 2010. Lecture Notes in Computer Science, vol 6748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22494-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-22494-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22493-5
Online ISBN: 978-3-642-22494-2
eBook Packages: Computer ScienceComputer Science (R0)