The disjoint cliques problem

DOI10.1051/RO/1997310100451MaRDI QIDQ4345417zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

cographdirected path graphinterval graphNP-completenesspairwise disjoint cliquespartial \(k\)-trees

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The clique-partitioning problem
• Disjoint cliques in claw-free graphs
• scientific article; zbMATH DE number 4130407
• The maximum clique problem
• scientific article; zbMATH DE number 426342
• The complexity of partitioning into disjoint cliques and a triangle-free graph
• The maximum clique interdiction problem
• The Ramsey-Turán problem for cliques
• Disjoint cliques and disjoint maximal independent sets of vertices in graphs
• On the tractability of finding disjoint clubs in a network

Cited in

(11)

• Polyhedral properties of the induced cluster subgraphs
• Scheduling with gaps: new models and algorithms
• Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
• The maximum independent union of cliques problem: complexity and exact approaches
• Finding disjoint dense clubs in a social network
• On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
• scientific article; zbMATH DE number 522858 (Why is no real title available?)
• Fixed-Parameter Algorithms for Cluster Vertex Deletion
• Maximizing dominance in the plane and its applications
• Noncontextual Pauli Hamiltonians
• Fixed-parameter algorithms for cluster vertex deletion

This page was built for publication: The disjoint cliques problem

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