Pages that link to "Item:Q5634016"
From MaRDI portal
The following pages link to Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph (Q5634016):
Displaying 7 items.
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- A note on the complexity of the chromatic number problem (Q1229753) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
