Finding augmenting chains in extensions of claw-free graphs
type: Item
instance of: scholarly article
title: Finding augmenting chains in extensions of claw-free graphs
zbMATH Open document ID: 1162.68412
DOI: 10.1016/S0020-0190(03)00223-0
author: Vadim Lozin
author: Alain Hertz
author: David Schindl
published in: Information Processing Letters
publication date: 2009-03-23T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5530946
zbMATH Keywords: stable sets
zbMATH Keywords: augmenting chains
zbMATH Keywords: polynomial algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks
cites work: Augmenting graphs for independent sets
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
cites work: Paths, Trees, and Flowers
cites work: Stable sets in two subclasses of banner-free graphs
cites work: On the stable set problem in special \(P_{5}\)-free graphs
cites work: \(P_{5}\)-free augmenting graphs and the maximum stable set problem
cites work: Stability in \(P_5\)- and banner-free graphs
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
cites work: Stable sets in certain \(P_6\)-free graphs
cites work: Some results on maximum stable sets in certain \(P_{5}\)-free graphs
cites work: Computing independent sets in graphs with large girth
cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
description: scientific article; zbMATH DE number 5530946