The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
RAIRO-Oper. Res., 48 1 (2014) 25-51
Published online: 2013-12-05
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
Hortensia Galeana-Sánchez, Felipe Hernández-Lorenzana and Rocío Sánchez-LópezBoletín de la Sociedad Matemática Mexicana 30 (3) (2024)
https://doi.org/10.1007/s40590-024-00645-0
Compatible Spanning Circuits and Forbidden Induced Subgraphs
Zhiwei Guo, Christoph Brause, Maximilian Geißer and Ingo SchiermeyerGraphs and Combinatorics 40 (1) (2024)
https://doi.org/10.1007/s00373-023-02735-8
Euler dynamic H -trails in edge-colored graphs
Carlos Vilchis-Alfaro and Hortensia Galeana-SánchezAKCE International Journal of Graphs and Combinatorics 21 (1) 48 (2024)
https://doi.org/10.1080/09728600.2023.2250837
Compatible Spanning Circuits Visiting Each Vertex Exactly a Specified Number of Times in Graphs with Generalized Transition Systems
Zhiwei Guo and Xiaoxia ChenParallel Processing Letters 34 (02) (2024)
https://doi.org/10.1142/S0129626424500051
On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs
Hortensia Galeana-Sánchez, Felipe Hernández-Lorenzana, Rocío Sánchez-López and Carlos Vilchis-AlfaroBoletín de la Sociedad Matemática Mexicana 30 (2) (2024)
https://doi.org/10.1007/s40590-024-00624-5
A generalization of properly colored paths and cycles in edge-colored graphs
Hortensia Galeana-Sánchez, Felipe Hernández-Lorenzana and Rocío Sánchez-LópezTheoretical Computer Science 946 113679 (2023)
https://doi.org/10.1016/j.tcs.2022.12.029
A Steady-State Grouping Genetic Algorithm for the Rainbow Spanning Forest Problem
Sudishna Ghoshal and Shyam SundarSN Computer Science 4 (4) (2023)
https://doi.org/10.1007/s42979-023-01766-5
H-Cycles in H-Colored Multigraphs
Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López and Juana Imelda Villarreal-ValdésGraphs and Combinatorics 38 (3) (2022)
https://doi.org/10.1007/s00373-022-02464-4
Almost eulerian compatible spanning circuits in edge-colored graphs
Zhiwei Guo, Hajo Broersma, Binlong Li and Shenggui ZhangDiscrete Mathematics 344 (1) 112174 (2021)
https://doi.org/10.1016/j.disc.2020.112174
Two heuristics for the rainbow spanning forest problem
Sudishna Ghoshal and Shyam SundarEuropean Journal of Operational Research 285 (3) 853 (2020)
https://doi.org/10.1016/j.ejor.2020.02.045
Compatible spanning circuits in edge-colored graphs
Zhiwei Guo, Binlong Li, Xueliang Li and Shenggui ZhangDiscrete Mathematics 343 (7) 111908 (2020)
https://doi.org/10.1016/j.disc.2020.111908
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
Zhiwei Guo, Hajo Broersma, Ruonan Li and Shenggui ZhangJournal of Combinatorial Optimization 40 (4) 1008 (2020)
https://doi.org/10.1007/s10878-020-00644-7
Some Conditions for the Existence of Euler H-trails
Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López and Juana Imelda Villarreal-ValdésGraphs and Combinatorics 35 (5) 1197 (2019)
https://doi.org/10.1007/s00373-019-02066-7
Exact approaches for the orderly colored longest path problem: Performance comparison
Francesco Carrabs, Raffaele Cerulli, Giovanni Felici and Gaurav SinghComputers & Operations Research 101 275 (2019)
https://doi.org/10.1016/j.cor.2018.08.005
The rainbow spanning forest problem
Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli and Selene SilvestriSoft Computing 22 (8) 2765 (2018)
https://doi.org/10.1007/s00500-017-2540-8
Chinese Postman Problem on edge-colored multigraphs
Gregory Gutin, Mark Jones, Bin Sheng, Magnus Wahlström and Anders YeoDiscrete Applied Mathematics 217 196 (2017)
https://doi.org/10.1016/j.dam.2016.08.005
Optimal pathway reconstruction on 3D NMR maps
Marta Szachniuk, Maria Cristina De Cola, Giovanni Felici, Dominique de Werra and Jacek BłażewiczDiscrete Applied Mathematics 182 134 (2015)
https://doi.org/10.1016/j.dam.2014.04.010