Chromatic kernel and its applications

DOI10.1007/S10878-014-9824-ZzbMATH Open1336.05130OpenAlexW1977528563MaRDI QIDQ266072FDOQ266072

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

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

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)

Cites Work

• Computational Complexity
• Correlation clustering
• Generalized median graphs and applications
• Title not available (Why is that?)
• A semidefinite programming approach to side chain positioning with new rounding strategies
• A local algorithm for finding dense subgraphs
• On Finding Dense Subgraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Gadgets, Approximation, and Linear Programming
• Greedily Finding a Dense Subgraph
• Finding the Jaccard median
• Some optimal inapproximability results
• The dense \(k\)-subgraph problem

Cited In (1)

• Title not available (Why is that?)

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)