Pages that link to "Item:Q2999332"
From MaRDI portal
The following pages link to Exact Algorithms for Intervalizing Colored Graphs (Q2999332):
Displaying 12 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- About equivalent interval colorings of weighted graphs (Q967426) (← links)
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths (Q1179200) (← links)
- Coloring interval graphs with First-Fit (Q1898342) (← links)
- Complexity of tree-coloring interval graphs equitably (Q2039688) (← links)
- Fragmented coloring of proper interval and split graphs (Q2355746) (← links)
- A technique for exact computation of precoloring extension on interval graphs (Q2841989) (← links)
- Subexponential Time Algorithms for Finding Small Tree and Path Decompositions (Q3452781) (← 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)