Algorithms and Complexity of s-Club Cluster Vertex Deletion
Authors:
- 30 June 2021
- book chapter
- Published by Springer Nature
- p. 152-164
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Finding large $k$ -clubs in undirected graphsComputing, 2012
- The recognition of triangle graphsTheoretical Computer Science, 2012
- Parameterized computational complexity of finding small-diameter subgraphsOptimization Letters, 2011
- Vertex cover might be hard to approximate to withinJournal of Computer and System Sciences, 2008
- Certifying Algorithms for Recognizing Interval Graphs and Permutation GraphsSIAM Journal on Computing, 2006
- Novel Approaches for Analyzing Biological NetworksJournal of Combinatorial Optimization, 2005
- An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid GraphsTheory of Computing Systems, 2003
- Treewidth and Minimum Fill-in on d-Trapezoid Graphs2002
- Distances in cocomparability graphs and their powersDiscrete Applied Mathematics, 1992
- The node-deletion problem for hereditary properties is NP-completeJournal of Computer and System Sciences, 1980