Finding clubs in graph classes
From MaRDI portal
Publication:400518
DOI10.1016/j.dam.2014.04.016zbMath1298.05092OpenAlexW2092080501MaRDI QIDQ400518
Arash Rafiey, Dieter Kratsch, Petr A. Golovach, Pinar Heggernes
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.04.016
Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Optimal approximation algorithms for maximum distance-bounded subgraph problems ⋮ On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems ⋮ The parameterized complexity of \(s\)-club with triangle and seed constraints ⋮ On the tractability of finding disjoint clubs in a network ⋮ Covering a Graph with Clubs ⋮ Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments ⋮ The parameterized complexity of \(s\)-club with triangle and seed constraints ⋮ On the tractability of covering a graph with 2-clubs ⋮ On structural parameterizations for the 2-club problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- The strong perfect graph theorem
- Clustering and domination in perfect graphs
- Graphs whose squares are chordal
- Erratum correction to graphs whose squares are chordal
- Parameterized computational complexity of finding small-diameter subgraphs
- Optimizing weakly triangulated graphs
- Algorithmic graph theory and perfect graphs
- Powers of distance-hereditary graphs
- On structural parameterizations for the 2-club problem
- Novel approaches for analyzing biological networks
- On Bipartite and Multipartite Clique Problems
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Approximating Maximum Diameter-Bounded Subgraphs
- A graph‐theoretic definition of a sociometric clique†
- A graph‐theoretic generalization of the clique concept
- Graph Classes: A Survey
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- Generalized Powers of Graphs and Their Algorithmic Use
This page was built for publication: Finding clubs in graph classes
