Pages that link to "Item:Q5524918"
From MaRDI portal
The following pages link to An upper bound for the chromatic number of a graph and its application to timetabling problems (Q5524918):
Displayed 40 items.
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697) (← links)
- Dynamic data resolution to improve the tractability of UMTS network planning (Q1945081) (← links)
- Maximum independent sets near the upper bound (Q2026337) (← links)
- Privacy-preserving data splitting: a combinatorial approach (Q2035465) (← links)
- An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
- The variational quantum eigensolver: a review of methods and best practices (Q2092477) (← links)
- Measurements of quantum Hamiltonians with locally-biased classical shadows (Q2124207) (← links)
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
- Bounded colouring motivated by the limited resource partially concurrent open shop problem (Q2241155) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- Extremal values of the chromatic number for a given degree sequence (Q2409517) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- Complexity insights of the minimum duplication problem (Q2440167) (← links)
- Fast algorithms for determining (generalized) core groups in social networks (Q2442801) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- Inequalities involving the irredundance number of a graph (Q2576844) (← links)
- Optimization of the integrated problem of employee timetabling and job shop scheduling (Q2669607) (← links)
- Modal logic S5 in answer set programming with lazy creation of worlds (Q2694545) (← links)
- Complexity Insights of the Minimum Duplication Problem (Q2891364) (← links)
- Mapping Cohesive Fracture and Fragmentation Simulations to Graphics Processor Units (Q2952798) (← links)
- A branch-and-cut algorithm for partition coloring (Q3057147) (← links)
- Graph Coloring Using Eigenvalue Decomposition (Q3216692) (← links)
- Some sequential graph colouring algorithms (Q3352500) (← links)
- Consecutive colorings of graphs (Q3770560) (← links)
- Local optimization of colorings of graphs (Q3780451) (← links)
- A simple nc recognition algorithm for welsh-powell opposition graphs (Q3989765) (← links)
- On colouring random graphs (Q4050627) (← links)
- Compactness and balancing in scheduling (Q4145144) (← links)
- (Q4229265) (← links)
- Improved bounds for the chromatic index of graphs and multigraphs (Q4719322) (← links)
- (Q4790880) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- Algorithmic bounds for the chromatic number† (Q5449019) (← links)
- Een indelingsprobleem (Q5538327) (← links)
- On the chromatic number of graphs (Q5942344) (← links)
- Multi-constructor CMSA for the maximum disjoint dominating sets problem (Q6065657) (← links)
- Recursive grain remapping scheme for phase‐field models of additive manufacturing (Q6090727) (← links)
- Graphs isomorphisms under edge-replacements and the family of amoebas (Q6133145) (← links)
- The parallel complexity of elimination ordering procedures (Q6143979) (← links)
- Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)