Pages that link to "Item:Q5410241"
From MaRDI portal
The following pages link to The Orderly Colored Longest Path Problem – a survey of applications and new algorithms (Q5410241):
Displaying 20 items.
- Chinese postman problem on edge-colored multigraphs (Q516812) (← links)
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069) (← links)
- The rainbow spanning forest problem (Q1797922) (← links)
- New models and algorithms for RNA pseudoknot order assignment (Q2023637) (← links)
- \(H\)-cycles in \(H\)-colored multigraphs (Q2117527) (← links)
- Compatible spanning circuits in edge-colored graphs (Q2182217) (← links)
- Two heuristics for the rainbow spanning forest problem (Q2184043) (← links)
- Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
- Optimal pathway reconstruction on 3D NMR maps (Q2255053) (← links)
- Some conditions for the existence of Euler \(H\)-trails (Q2334082) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles (Q2656965) (← links)
- A generalization of properly colored paths and cycles in edge-colored graphs (Q2682924) (← links)
- Progress in nuclear vector replacement for NMR protein structure-based assignments (Q2805494) (← links)
- Milp-hyperbox classification for structure-based drug design in the discovery of small molecule inhibitors of SIRTUIN6 (Q2805500) (← links)
- Theory and application of reciprocal transformation of “path problem” and “time float problem” (Q2969956) (← links)
- Compatible spanning circuits and forbidden induced subgraphs (Q6184989) (← links)
- On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs (Q6564830) (← links)
- Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions (Q6602386) (← links)
- Euler dynamic <i>H</i> -trails in edge-colored graphs (Q6651158) (← links)