Publication:4234148

zbMath0945.68524MaRDI QIDQ4234148

William R. Pulleyblank, F. Bruce Shepherd

Publication date: 10 October 2000

Mathematics Subject Classification ID

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

90C05: Linear programming

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Unnamed Item, Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition, On the Stable Set Polytope of Claw-Free Graphs, Unnamed Item, Extended formulations in combinatorial optimization, Extended formulations in combinatorial optimization, Discrete relaxations of combinatorial programs, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, The stable set polytope of quasi-line graphs, Gear composition and the stable set polytope, Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs, Hamiltonicity in claw-free graphs, Clique family inequalities for the stable set polytope of quasi-line graphs., An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\), Applying Lehman's theorems to packing problems, A reduction algorithm for the weighted stable set problem in claw-free graphs, Unnamed Item, A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs