Abstract
We deal with different algorithmic questions regarding properly arc-colored s-t paths, trails and circuits in arc-colored digraphs. Given an arc-colored digraph D c with c ≥ 2 colors, we show that the problem of maximizing the number of arc disjoint properly arc-colored s-t trails can be solved in polynomial time. Surprisingly, we prove that the determination of one properly arc-colored s-t path is NP-complete even for planar digraphs containing no properly arc-colored circuits and c = Ω(n), where n denotes the number of vertices in D c. If the digraph is an arc-colored tournament, we show that deciding whether it contains a properly arc-colored circuit passing through a given vertex x (resp., properly arc-colored Hamiltonian s-t path) is NP-complete, even if c = 2. As a consequence, we solve a weak version of an open problem posed in Gutin et. al. [17].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abouelaoualim, A., Das, K.C., Faria, L., Manoussakis, Y., Martinhon, C.A., Saad, R.: Paths and trails in edge-colored graphs. Theoretical Computer Science 409(3), 497–510 (2008)
Amaldi, E., Galbiati, G., Maffioli, F.: On the minimum reload cost paths, tours and flows. In: Proc. CTW 2008, pp. 112–115 (2008)
Bang-Jensen, J., Gutin, G.: Alternating cycles and paths in edge-coloured multigraphs: a survey. Discrete Mathematics 165/166, 39–60 (1997)
Bang-Jensen, J., Gutin, G.: Alternating cycles and trails in 2-edge-coloured complete multigraphs. Discrete Mathematics 188, 61–72 (1998)
Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 1st edn. Springer Monographs in Mathematics. Springer, London (2006)
Bang-Jensen, J., Manoussakis, Y., Thomassen, C.: A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. J. Algorithms 13(1), 114–127 (1992)
Benkouar, A., Manoussakis, Y., Paschos, V.T., Saad, R.: On the complexity of Hamiltonian and Eulerian problems in edge-colored complete graphs. RAIRO Journal On Operations Research 30(4), 417–438 (1996)
Bondy, J.A., Murty, U.S.R.: Graph Theory (Graduate Texts in Mathematics). Springer, Heidelberg (2008)
Chou, W.S., Manoussakis, Y., Megalakaki, O., Spyratos, M., Tuza, Z.: Paths through fixed vertices in edge-colored graphs. Mathématiques et Sciences Humaines 127, 49–58 (1994)
Dorniger, D.: Hamiltonian circuits determining the order of chromossomes. Discrete Applied Mathematics 50, 159–168 (1994)
Feng, J., Giesen, H.-E., Guo, Y., Gutin, G., Jensen, T., Rafiey, A.: Characterization of edge-colored complete graphs with properly colored Hamilton paths. J. Graph Theory 53, 333–346 (2006)
Gabow, H., Maheshwari, S., Osterweil, L.: On two Problems in the Generation of Program Test Paths. IEEE Trans. on Soft. Eng., SE-2(3), 227–231 (1976)
Gamvros, I.: Satellite network design, optimization and management. PhD thesis, University of Maryland (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Gourvès, L., Lyra, A., Martinhon, C., Monnot, J.: The minimum reload s-t path/trail/walk problems. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 621–632. Springer, Heidelberg (2009)
Gourvès, L., Lyra, A., Martinhon, C., Monnot, J., Protti, F.: On s-t paths and trails in edge-colored graphs. In: Proc. LAGOS 2009. Electronic Notes in Discrete Mathematics, vol. 35, pp. 221–226 (2009)
Gutin, G., Sudakov, B., Yeo, A.: Note on alternating directed cycles. Discrete Mathematics 191, 101–107 (1998)
Gutin, G., Jung Kim, E.: Properly Coloured Cycles and Paths: Results and Open Problems. In: Lipshteyn, M., Levit, V.E., McConnell, R.M. (eds.) Graph Theory, Computational Intelligence and Thought. LNCS, vol. 5420, pp. 200–208. Springer, Heidelberg (2009)
Hu, T.C., Kuo, Y.S.: Graph folding and programmable logical arrays. Networks 17, 19–37 (1987)
Kotizig, A.: Moves without forbidden transitions in a graph. Math. Fyz. Cazopis 18, 76–80 (1968)
Pevzner, P.: DNA physical mapping and properly edge-colored eurelian cycles in colored graphs. Algorithmica 13, 77–105 (1995)
Pevzner, P.: Computational Molecular Biology: An Algorithmic Approach. The MIT Press, Cambridge (2000)
Szeider, S.: Finding paths in graphs avoiding forbidden transitions. Discrete Applied Mathematics 126, 261–273 (2003)
Yeo, A.: A note on Alternating Cycles in Edge-coloured Graphs. Journal of Combinatorial Theory, Series B-69, 222–225 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gourvès, L., Lyra, A., Martinhon, C., Monnot, J. (2010). Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds) Theory and Applications of Models of Computation. TAMC 2010. Lecture Notes in Computer Science, vol 6108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13562-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-13562-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13561-3
Online ISBN: 978-3-642-13562-0
eBook Packages: Computer ScienceComputer Science (R0)