Pages that link to "Item:Q1276168"
From MaRDI portal
The following pages link to Zero knowledge and the chromatic number (Q1276168):
Displaying 37 items.
- Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← links)
- A competitive analysis for balanced transactional memory workloads (Q2429336) (← links)
- Cross-layer optimization in ultra wideband networks (Q2463846) (← links)
- Fractionally total colouring \(G_{n,p}\) (Q2482106) (← links)
- Tight approximability results for test set problems in bioinformatics (Q2485280) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- Injective coloring of some subclasses of bipartite graphs and chordal graphs (Q2659063) (← links)
- Network design under general wireless interference (Q2665910) (← links)
- Hypercontractivity via tensor calculus (Q2695312) (← links)
- On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)
- Semi-Definite positive Programming Relaxations for Graph K<sub>n</sub>-Coloring in Frequency Assignment (Q2773169) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring (Q2885476) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- On the Complexity of the Minimum Independent Set Partition Problem (Q3196378) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- The Hardness of Approximating Poset Dimension (Q3503501) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Complexity of Coloring Random Graphs (Q4577957) (← links)
- On percolation and ‐hardness (Q4633317) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- (Q5002765) (← links)
- (Q5092472) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs (Q5302070) (← links)
- On the recursive largest first algorithm for graph colouring (Q5451459) (← links)
- On Injective Colourings of Chordal Graphs (Q5458556) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- (Q5743487) (← links)
- A Characterization of hard-to-cover CSPs (Q5857608) (← links)
- Effective Wireless Scheduling via Hypergraph Sketches (Q5858652) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
- Fractional path coloring in bounded degree trees with applications (Q5961980) (← links)
- Malleable scheduling beyond identical machines (Q6090217) (← links)
