Pages that link to "Item:Q4083458"
From MaRDI portal
The following pages link to The Complexity of Near-Optimal Graph Coloring (Q4083458):
Displaying 50 items.
- Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- On approximating the minimum independent dominating set (Q750159) (← links)
- Kneser's conjecture, chromatic number, and homotopy (Q755592) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320) (← links)
- A better performance guarantee for approximate graph coloring (Q911757) (← links)
- Coloring certain proximity graphs (Q917569) (← links)
- Approximation algorithm for maximum edge coloring (Q1007243) (← links)
- Non-approximability of just-in-time scheduling (Q1041346) (← links)
- Extremal problems concerning Kneser-graphs (Q1057858) (← links)
- Clustering to minimize the maximum intercluster distance (Q1059958) (← links)
- Verifying nonrigidity (Q1072373) (← links)
- A graph coloring algorithm for large scale scheduling problems (Q1096533) (← links)
- On the complexity of H-coloring (Q1100215) (← links)
- The complexity of multicolouring (Q1113919) (← links)
- Maximum bipartite subgraphs of Kneser graphs (Q1121290) (← links)
- Structure preserving reductions among convex optimization problems (Q1143173) (← links)
- Complexity of dimension three and some related edge-covering characteristics of graphs (Q1143791) (← links)
- How well can a graph be n-colored? (Q1148324) (← links)
- Non deterministic polynomial optimization problems and their approximations (Q1152215) (← links)
- Discrete extremal problems (Q1152306) (← links)
- A note on the approximation of the MAX CLIQUE problem (Q1183423) (← links)
- The smallest hard-to-color graph (Q1185079) (← links)
- Optimization, approximation, and complexity classes (Q1186548) (← links)
- Finding approximate solutions to NP-hard problems by neural networks is hard (Q1186583) (← links)
- Quantifiers and approximation (Q1208413) (← links)
- A note on the complexity of the chromatic number problem (Q1229753) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
- Bidegree of graph and degeneracy number (Q1326070) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- On proving that a graph has no large clique: A connection with Ramsey theory (Q1351164) (← links)
- Routing a vehicle of capacity greater than one (Q1382252) (← links)
- The multichromatic numbers of some Kneser graphs (Q1584256) (← links)
- NP-completeness of a family of graph-colouring problems (Q1835680) (← links)
- Coloring graph products---a survey (Q1923489) (← links)
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
- Worst-case analysis of a new heuristic for the travelling salesman problem (Q2120141) (← links)
- On the triangle clique cover and \(K_t\) clique cover problems (Q2279271) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- Orthogonal representations over finite fields and the chromatic number of graphs (Q2563517) (← links)
- Near-linear convergence of the random Osborne algorithm for matrix balancing (Q2687049) (← links)
- Graph Coloring Using Eigenvalue Decomposition (Q3216692) (← links)
- Local optimization of colorings of graphs (Q3780451) (← links)
