Chromatic kernel and its applications

DOI10.1007/S10878-014-9824-ZMaRDI QIDQ266072zbMATH OpenOpenAlexFDO

Authors Hu Ding, Branislav Stojkovic, Zihe Chen, Andrew Fritz, Nitasha Sehgal, Ronald Berezney, Jinhui Xu, Andrew Hughes, Lei Xu

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

zbMATH Keywords

random samplingapproximate algorithmsbiomedical applications

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Recommendations

• scientific article; zbMATH DE number 1163713
• Clustering on k-Edge-Colored Graphs
• Clustering on \(k\)-edge-colored graphs
• Set partitioning via inclusion-exclusion
• The constrained partition problem with kernels

Cites work

• scientific article; zbMATH DE number 1670532 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 1263204 (Why is no real title available?)
• A local algorithm for finding dense subgraphs
• A semidefinite programming approach to side chain positioning with new rounding strategies
• Computational Complexity
• Correlation clustering
• Finding the Jaccard median
• Gadgets, Approximation, and Linear Programming
• Generalized median graphs and applications
• Greedily Finding a Dense Subgraph
• On Finding Dense Subgraphs
• Some optimal inapproximability results
• The dense \(k\)-subgraph problem

Cited in

(1)

• scientific article; zbMATH DE number 6315371 (Why is no real title available?)

This page was built for publication: Chromatic kernel and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266072)