Pages that link to "Item:Q4381058"
From MaRDI portal
The following pages link to Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring (Q4381058):
Displaying 13 items.
- On the max min vertex cover problem (Q499339) (← links)
- New results on \(k\)-independence of graphs (Q528993) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- An experimental evaluation of local search heuristics for graph partitioning (Q1382773) (← links)
- Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- Planarization and fragmentability of some classes of graphs (Q2427499) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- Pairwise-Interaction Games (Q3012801) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- (Q5140710) (← links)
- Algorithm for optimal winner determination in combinatorial auctions (Q5958538) (← links)