Pages that link to "Item:Q1433224"
From MaRDI portal
The following pages link to A note on the complexity of longest path problems related to graph coloring (Q1433224):
Displaying 5 items.
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- On the complexity of path problems in properly colored directed graphs (Q1928492) (← links)
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504) (← links)
- The Orderly Colored Longest Path Problem – a survey of applications and new algorithms (Q5410241) (← links)
- Arc-dependent networks: theoretical insights and a computational study (Q6588520) (← links)