Pages that link to "Item:Q2509032"
From MaRDI portal
The following pages link to Complexity of the exact domatic number problem and of the exact conveyor flow shop problem (Q2509032):
Displaying 7 items.
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- Finding domatic partitions in infinite graphs (Q888598) (← links)
- Exact complexity of exact-four-colorability (Q1014384) (← links)
- Domatic partitions of computable graphs (Q2436619) (← links)
- Manipulation in communication structures of graph-restricted weighted voting games (Q2695440) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)