Pages that link to "Item:Q1847370"
From MaRDI portal
The following pages link to Deciding \(k\)-colorability in expected polynomial time (Q1847370):
Displaying 4 items.
- Backtrack: An O(1) expected time algorithm for the graph coloring problem (Q794430) (← links)
- A randomized algorithm for \(k\)-colorability (Q1331989) (← links)
- Expected complexity of graph partitioning problems (Q1346695) (← links)
- Deciding 3-colourability in less than O(1.415n) steps (Q6143975) (← links)