Polynomial algorithm for finding the largest independent sets in graphs without forks

Authors:
V. E. Alekseev
Affiliations:
Nizhniy Novgorod State University, Prospekt Gagarnia 23/2, 603600 Nizhniy Novgorod, GSP-20, Russia
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 2
Cited 15

Stability number of bull- and chair-free graphs

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Independent sets in extensions of 2K2-free graphs

Discrete Applied Mathematics
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Maximum independent sets in graphs of low degree

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On finding augmenting graphs

Discrete Applied Mathematics
The Maximum Independent Set Problem in Planar Graphs

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

Journal of Discrete Algorithms
Maximum independent sets in subclasses of P5-free graphs

Information Processing Letters
Large independent sets in random regular graphs

Theoretical Computer Science
Independent sets in extensions of 2K2-free graphs

Discrete Applied Mathematics
Parameterized algorithms for the independent set problem in some hereditary graph classes

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Practical computation of optimal schedules in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
New applications of clique separator decomposition for the maximum weight stable set problem

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Maximum regular induced subgraphs in 2P3-free graphs

Theoretical Computer Science
Uncover low degree vertices and minimise the mess: independent sets in random regular graphs

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Boundary properties of the satisfiability problems

Information Processing Letters

Quantified Score

Hi-index	0.05

Visualization

Abstract

A fork is a graph that is obtained from K1,3 by subdividing one edge. It is known [6-8] that for K1,3-free graphs the problem of finding the largest independent set can be solved in a polynomial time. In this paper, we prove that this is also true for the wider class of fork-free graphs.