Pages that link to "Item:Q5958809"
From MaRDI portal
The following pages link to Frozen development in graph coloring (Q5958809):
Displaying 29 items.
- Fuzzy colouring of fuzzy graphs (Q258334) (← links)
- Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- The \(k\)-coloring fitness landscape (Q491197) (← links)
- A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming (Q507445) (← links)
- Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- Spines of random constraint satisfaction problems: definition and connection with computational complexity (Q812393) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- A cooperative search method for the \(k\)-coloring problem (Q928692) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- Regular pattern-free coloring (Q2172395) (← links)
- Constructive generation of very hard 3-colorability instances (Q2467358) (← links)
- Another look at graph coloring via propositional satisfiability (Q2467359) (← links)
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Covering arrays on graphs (Q2565691) (← links)
- On the complexity of unfrozen problems (Q2581544) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- Coloring random graphs (Q2837678) (← links)
- Tropical lower bound for extended formulations. II. Deficiency graphs of matrices (Q3120460) (← links)
- Super Solutions of Random Instances of Satisfiability (Q3452579) (← links)
- CsegGraph: a graph colouring instance generator (Q3643182) (← links)
- Complexity of Coloring Random Graphs (Q4577957) (← links)
- Towards backbone computing: A Greedy-Whitening based approach (Q5145436) (← links)
- On the Integration of Singleton Consistencies and Look-Ahead Heuristics (Q5302725) (← links)
- A fresh look at a randomized massively parallel graph coloring algorithm (Q6617714) (← links)