Pages that link to "Item:Q1276168"
From MaRDI portal
The following pages link to Zero knowledge and the chromatic number (Q1276168):
Displaying 50 items.
- Coloring immersion-free graphs (Q326817) (← links)
- On the complexity of injective colorings and its generalizations (Q387816) (← links)
- Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- A pure labeled transition semantics for the applied pi calculus (Q621583) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- Computing the partition function for graph homomorphisms (Q681595) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- An improved algorithm for approximating the chromatic number of \(G_{n,p}\) (Q845732) (← links)
- On the complexity of deriving position specific score matrices from positive and negative sequences (Q876465) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Computing the partition function for graph homomorphisms with multiplicities (Q889510) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- Tight results on minimum entropy set cover (Q926288) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- Why almost all \(k\)-colorable graphs are easy to color (Q968270) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- On the tractability of coloring semirandom graphs (Q975431) (← links)
- Exponential-time approximation of weighted set cover (Q989538) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- A note on coloring sparse random graphs (Q1025963) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Multicoloring trees. (Q1401922) (← links)
- Conjunctive query containment revisited (Q1575132) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Blocker size via matching minors (Q1637141) (← links)
- Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Towards optimal lower bounds for clique and chromatic number. (Q1874411) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- On the intractability landscape of digraph intersection representations (Q2169961) (← links)
- Bisecting and \(D\)-secting families for set systems (Q2181239) (← links)
- Radio aggregation scheduling (Q2202004) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
