Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé

Cites work

scientific article; zbMATH DE number 3702733 (Why is no real title available?)
scientific article; zbMATH DE number 3518832 (Why is no real title available?)
scientific article; zbMATH DE number 3345048 (Why is no real title available?)
Maximum matching and a polyhedron with 0,1-vertices
On maximal independent sets of vertices in claw-free graphs
Paths, Trees, and Flowers
The strong perfect-graph conjecture is true for $K_{1,3}$-free graphs

Cited in

(only showing first 100 items - show all)

Solving the weighted stable set problem in claw-free graphs via decomposition
Counting edge-injective homomorphisms and matchings on restricted graph classes
Few induced disjoint paths for $H$-free graphs
Independent set reconfiguration in cographs and their generalizations
Regular independent sets
Few induced disjoint paths for $H$-free graphs
Connected vertex cover for $(sP_1+P_5)$-free graphs
On cycle transversals and their connected variants in the absence of a small linear forest
The maximum clique problem
Independent sets of maximum weight in ($p,q$)-colorable graphs.
Stability in CAN-free graphs
Extending the MAX algorithm for maximum independent set
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
Colouring squares of claw-free graphs
Independent sets in some classes of $S_{i,j,k}$-free graphs
Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes
scientific article; zbMATH DE number 7651174 (Why is no real title available?)
A note on graphs contraction-critical with respect to independence number
Maximum regular induced subgraphs in 2P₃-free graphs
Independent feedback vertex set for $P_5$-free graphs
The Maximum Independent Set Problem in Planar Graphs
The struction of a graph: Application to CN-free graphs
Vertex cover at distance on $H$-free graphs
On the complexity of list $\mathcal{H}$-packing for sparse graph classes
On the vertex packing problem
On claw-free asteroidal triple-free graphs
A polytime preprocess algorithm for the maximum independent set problem
Augmenting approach for some maximum set problems
The maximum independent set problem in subclasses of $S_{i, j, k}$-free graphs
On the feedback vertex set polytope of a series-parallel graph
Lovász-Schrijver PSD-operator on claw-free graphs
On the use of Boolean methods for the computation of the stability number
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
Enumeration of maximal irredundant sets for claw-free graphs
The complexity of dissociation set problems in graphs
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
Stabex method for extension of $\alpha$-polynomial hereditary classes.
Polynomial algorithms for the maximum stable set problem on particular classes of $P_{5}$-free graphs
scientific article; zbMATH DE number 7742928 (Why is no real title available?)
Claw-free strictly Deza graphs
Correction to: ``A connection between sports and matroids: how many teams can we beat?
Enumeration of maximal irredundant sets for claw-free graphs
Claw-free graphs---a survey
On easy and hard hereditary classes of graphs with respect to the independent set problem
A survey on graphs with convex quadratic stability number
The limits of local search for weighted $k$-set packing
Hard and easy instances of L-tromino tilings
Parameterized inapproximability of independent set in $H$-free graphs
On Some Properties of the Struction of a Graph
Polynomially solvable cases for the maximum stable set problem
Maximum independent sets near the upper bound
On finding augmenting graphs
A Polynomial Kernel for Line Graph Deletion
New results on independent sets in extensions of $2K_2$-free graphs
Stability in $P_5$- and banner-free graphs
Augmenting chains in graphs without a skew star.
Independent sets in extensions of 2$K_{2}$-free graphs
From matchings to independent sets
On maximal independent sets of vertices in claw-free graphs
Sparse regular induced subgraphs in $2P_3$-free graphs
Combinatorics and algorithms for augmenting graphs
Reconfiguration in bounded bandwidth and tree-depth
Colouring squares of claw-free graphs
A Note on the Minimum H-Subgraph Edge Deletion
Matching extension in $K_{1,r}$-free graphs with independent claw centers
Boundary classes for graph problems involving non-local properties
Independence systems with continuous cardinality of bases
New applications of clique separator decomposition for the maximum weight stable set problem
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Polynomial algorithm for finding the largest independent sets in graphs without forks
Dominating sets and Hamiltonicity in $K_{1,3}$-free graphs
The complexity of generalized clique packing
The stable set polytope of quasi-line graphs
scientific article; zbMATH DE number 2230228 (Why is no real title available?)
Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
A nice class for the vertex packing problem
The limits of local search for weighted $k$-set packing
Stability number of bull- and chair-free graphs
Maximum weight independent sets for ($S_{1,2,4}$, triangle)-free graphs in polynomial time
Well-covered triangulations. IV
Polytope des independants d'un graphe série-parallèle
Independent domination in finitely defined classes of graphs
Some observations on maximum weight stable sets in certain $P_{5}$-free graphs
On the structure of 4-regular planar well-covered graphs
Clique-circulants and the stable set polytope of fuzzy circular interval graphs
On the complexity of the independent set problem in triangle graphs
Independent sets in $(P_4+P_4$,triangle)-free graphs
Stable sets in certain $P_6$-free graphs
Coloring graph classes with no induced fork via perfect divisibility
On the complexity of colouring antiprismatic graphs
Clique family inequalities for the stable set polytope of quasi-line graphs.
Stable sets in two subclasses of banner-free graphs
On the maximum acyclic subgraph problem under disjunctive constraints
Partitioning $H$-free graphs of bounded diameter
Classes of perfect graphs
Edge-disjoint packings of graphs
A sufficient condition to extend polynomial results for the maximum independent set problem
Computing subset transversals in $H$-free graphs
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in $\boldsymbol{H}$-Free Graphs

This page was built for publication: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144589)