The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
From MaRDI portal
Publication:5410241
DOI10.1051/ro/2013046zbMath1288.90117OpenAlexW2105225269WikidataQ57387711 ScholiaQ57387711MaRDI QIDQ5410241
Marta Szachniuk, Jacek Błażewicz, Giovanni Felici, Maria Cristina De Cola
Publication date: 16 April 2014
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2014__48_1_25_0/
Programming involving graphs or networks (90C35) Applications of graph theory to circuits and networks (94C15)
Related Items
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs, Exact approaches for the orderly colored longest path problem: performance comparison, Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles, Compatible spanning circuits in edge-colored graphs, Two heuristics for the rainbow spanning forest problem, A generalization of properly colored paths and cycles in edge-colored graphs, Compatible spanning circuits and forbidden induced subgraphs, Theory and application of reciprocal transformation of “path problem” and “time float problem”, Almost Eulerian compatible spanning circuits in edge-colored graphs, Chinese postman problem on edge-colored multigraphs, Optimal pathway reconstruction on 3D NMR maps, New models and algorithms for RNA pseudoknot order assignment, The rainbow spanning forest problem, Progress in Nuclear Vector Replacement for NMR Protein Structure-Based Assignments, Milp-hyperbox classification for structure-based drug design in the discovery of small molecule inhibitors of SIRTUIN6, Some conditions for the existence of Euler \(H\)-trails, \(H\)-cycles in \(H\)-colored multigraphs
