Chromatic kernel and its applications
From MaRDI portal
Publication:266072
DOI10.1007/s10878-014-9824-zzbMath1336.05130OpenAlexW1977528563MaRDI QIDQ266072
Lei Xu, Hu Ding, Zihe Chen, Andrew Fritz, Ronald Berezney, Branislav Stojkovic, Nitasha Sehgal, Jinhui Xu, Andrew D. Hughes
Publication date: 13 April 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9824-z
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Cites Work
- Correlation clustering
- Generalized median graphs and applications
- A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies
- On Finding Dense Subgraphs
- Gadgets, Approximation, and Linear Programming
- Greedily Finding a Dense Subgraph
- Computational Complexity
- Some optimal inapproximability results
- The dense \(k\)-subgraph problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Chromatic kernel and its applications