Cliques and clubs

DOI10.1007/978-3-642-38233-8_23zbMATH Open1382.68108OpenAlexW2180950855MaRDI QIDQ4924656FDOQ4924656

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)

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

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)