Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

@article{Faenza2014SolvingTW,
  title={Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition},
  author={Yuri Faenza and Gianpaolo Oriolo and Gautier Stauffer},
  journal={J. ACM},
  year={2014},
  volume={61},
  pages={20:1-20:41}
}
We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in O(|V|(|E| + |V| log|V|))-time, drastically improving the previous best known complexity bound. This algorithm is based on a novel decomposition theorem for claw-free graphs, which is also introduced in the present article. Despite being weaker than the structural results for claw-free graphs given by Chudnovsky and Seymour [2005, 2008a, 2008b] our decomposition theorem is, on the other… Expand
An algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4
In this paper we show that a connected {claw, net}-free graph G ( V , E ) with α ( G ) ? 4 is the union of a strongly bisimplicial clique Q and at most two clique-strips. A clique is stronglyExpand
An O ( n 2 log n ) algorithm for the weighted stable set problem in claw-free graphs
A graph G(V,E) is claw-free if no vertex has three pairwise nonadjacent neighbours. The Maximum Weight Stable Set (MWSS) Problem in a claw-free graph is a natural generalization of the MatchingExpand
Linear-time Algorithms for Eliminating Claws in Graphs
TLDR
It is shown that the problem of determining the distance of a given graph to a claw-free graph can be solved in linear time by a simpler algorithm on forests, and the exact values for full $k$-ary trees are determined. Expand
Domination When the Stars Are Out
TLDR
It is shown that Dominating Set on claw-free graphs is (i) fixed-parameter tractable and (ii) even possesses a polynomial kernel. Expand
Disconnected cuts in claw-free graphs
TLDR
It is proved that Disconnected Cut is polynomial-time solvable on claw-free graphs, answering a question of Ito et al. (TCS 2011) and proving the basis for this result is a decomposition theorem for claw- free graphs of diameter 2. Expand
Maximum Weight Independent Sets for (S1, 2, 4, Triangle)-Free Graphs in Polynomial Time
TLDR
This paper shows that MWIS can be solved in polynomial time for (S1,2,4,triangle)-free graphs which generalizes the result for (P7,triangles)- free graphs. Expand
Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time
TLDR
It is shown that MWIS can be solved in polynomial time for ($P_7$,triangle)-free graphs and may provide some progress in the study of MWIS for P_7-free graphs. Expand
An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $\alpha({G}) \le 3$
TLDR
This paper shows how to solve the Maximum Weight Stable Set Problem in a claw-free graph G(V,E) with α(G) ≤ 3 in time O(|E| log |V |) and improves the bound of O( |E||V|) due to Faenza et alii. Expand
Disconnected Cuts in Claw-free Graphs
TLDR
It is proved that Dis connected Cut is polynomial-time solvable on claw-free graphs, answering the question of Ito et al. (TCS 2011) and proving two further novel algorithmic results, namely Disconnected Cut isPolynomial -time solable on circular-arc graphs and line graphs. Expand
Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number
TLDR
A polynomial-time approximation scheme for graphs with oCP(G)=o(n/log(n)), and an alpha-approximation algorithm for any graph where alpha smoothly increases from a constant to n as ocp(G) grows from O (n/ log(n)) to n/3. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 60 REFERENCES
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in O(|V|(|E| + |V| log|V|))-time, drastically improving the previous best known complexity ...
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
TLDR
The main contribution of this paper is a new polynomial time algorithm for the mwss in claw-free graphs, and a rough analysis of the complexity of this algorithm gives a time bound of O(n6), where n is the number of vertices in the graph, and which the authors hope can be improved by a finer analysis. Expand
Domination When the Stars Are Out
TLDR
It is shown that Dominating Set on claw-free graphs is (i) fixed-parameter tractable and (ii) even possesses a polynomial kernel. Expand
On maximal independent sets of vertices in claw-free graphs
  • G. Minty
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1980
TLDR
Given a finite claw-free graph with real numbers assigned to the vertices, this work exhibits an algorithm for producing an independent set of vertices of maximum total weight, which is “efficient” in the sense of J. Edmonds. Expand
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs
TLDR
This paper shows that a mwcc of a perfect strip-composed graph, with the basic graphs belonging to a class ${\cal G}$, can be found in polynomial time, and designs a new, more efficient, combinatorial algorithm for the mwCC problem on strip- Composed claw-free perfect graphs. Expand
Claw-free graphs, skeletal graphs, and a stronger conjecture on $ω$, $Δ$, and $χ$
The second author's B.A.R. ω, Δ, i¾? conjecture proposes that every graph satisfies i¾?i¾?i¾?12Δ+1+ωi¾?. In this article, we prove that the conjecture holds for all claw-free graphs. Our approachExpand
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
TLDR
Decomposition by clique separators and by homogeneous sets is combined and it is shown that the resulting binary tree gives an efficient way for solving the MWS problem. Expand
On linear and circular structure of (claw, net)-free graphs
TLDR
It is shown how one can use structural properties of (claw, net)-free graphs to solve efficiently the domination, independent domination, and independent set problems on these graphs. Expand
A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph
The maximum weight/cardinality stable set problem is to nd a maximum weight/cardinality stable set of a given graph. It is well known that these problems for general graphs belong to the class ofExpand
On claw-free asteroidal triple-free graphs
We present an O(n2.376) algorithm for recognizing claw-free AT-free graphs and a linear-time algorithm for computing the set of all central vertices of a claw-free AT-free graph. In addition, we giveExpand
...
1
2
3
4
5
...