Pages that link to "Item:Q255264"
From MaRDI portal
The following pages link to Exact algorithms for intervalizing coloured graphs (Q255264):
Displaying 10 items.
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths (Q1179200) (← links)
- Complexity of tree-coloring interval graphs equitably (Q2039688) (← links)
- A technique for exact computation of precoloring extension on interval graphs (Q2841989) (← links)
- Exact Algorithms for Intervalizing Colored Graphs (Q2999332) (← links)
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles (Q3578378) (← links)
- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs (Q3638867) (← links)
- Intervalizing k-colored graphs (Q4645169) (← links)
- Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)
- Template-driven rainbow coloring of proper interval graphs (Q5925620) (← links)