The disjoint cliques problem
From MaRDI portal
Publication:4345417
DOI10.1051/ro/1997310100451zbMath0881.90123OpenAlexW2491387832MaRDI QIDQ4345417
Petra Scheffler, Gerhard J. Woeginger, Klaus Jansen
Publication date: 19 February 1998
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105140
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (7)
The maximum independent union of cliques problem: complexity and exact approaches ⋮ Polyhedral properties of the induced cluster subgraphs ⋮ Fixed-parameter algorithms for cluster vertex deletion ⋮ Fixed-Parameter Algorithms for Cluster Vertex Deletion ⋮ On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes ⋮ Maximizing dominance in the plane and its applications ⋮ Scheduling with gaps: new models and algorithms
This page was built for publication: The disjoint cliques problem
