Pages that link to "Item:Q2768314"
From MaRDI portal
The following pages link to Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. (Q2768314):
Displaying 30 items.
- MP or not MP: that is the question (Q283264) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- Enumerating maximal independent sets with applications to graph colouring. (Q703280) (← links)
- Improved edge-coloring with three colors (Q837164) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- An exact algorithm for the channel assignment problem (Q1764816) (← links)
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem (Q1786599) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- It is tough to be a plumber (Q1885007) (← links)
- Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← links)
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- Constructive generation of very hard 3-colorability instances (Q2467358) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
- Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs (Q3503578) (← links)
- The Time Complexity of Constraint Satisfaction (Q3503589) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- 3-coloring in time (Q4652410) (← links)
- On the number of maximal bipartite subgraphs of a graph (Q4667793) (← links)
- (Q4784290) (← links)
- Worst-case time bounds for coloring and satisfiability problems (Q4806606) (← links)
- Solving NP-Complete Problems with Quantum Search (Q5458579) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897192) (← links)
