Cliques and clubs

DOI10.1007/978-3-642-38233-8_23MaRDI QIDQ4924656zbMATHOpenAlexFDO

Authors Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey

Publication date 7 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38233-8_23

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Finding clubs in graph classes
• On the tractability of finding disjoint clubs in a network
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
• Finding large \(k\)-clubs in undirected graphs
• Algorithms for the maximum k-club problem in graphs

Cited in

(8)

• Optimal approximation algorithms for maximum distance-bounded subgraph problems
• Clubs and the Market
• On the tractability of finding disjoint clubs in a network
• Finding clubs in graph classes
• Covering with clubs: complexity and approximability
• Covering a graph with clubs
• scientific article; zbMATH DE number 5848566 (Why is no real title available?)
• On biconnected and fragile subgraphs of low diameter

This page was built for publication: Cliques and clubs

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