On the feedback vertex set polytope of a series-parallel graph

DOI10.1016/J.DISOPT.2009.01.004MaRDI QIDQ834183zbMATH OpenOpenAlexFDO

Authors Samuel Fiorini, Odile Marcotte

Publication date 19 August 2009

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2009.01.004

zbMATH Keywords

polytopefacetfeedback vertex setseries-parallel graphmin-Max relation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• On the stable set polytope of a series-parallel graph
• A polyhedral approach to the feedback vertex set problem
• Simultaneous feedback vertex set: a parameterized perspective
• Simultaneous feedback vertex set: a parameterized perspective
• On the feedback vertex set problem for a planar graph
• A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs
• Feedback Vertex Sets on Tree Convex Bipartite Graphs
• Feedback vertex set on planar graphs
• Feedback vertex sets in cubic multigraphs
• On parameterized independent feedback vertex set

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3637616 (Why is no real title available?)
• scientific article; zbMATH DE number 1944139 (Why is no real title available?)
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Algorithms and computations. 6th international symposium, ISAAC '95, Cairns, Australia, December 4--6, 1995. Proceedings
• Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
• Clique family inequalities for the stable set polytope of quasi-line graphs.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
• Covering a symmetric poset by symmetric chains
• Easy problems for tree-decomposable graphs
• Matching theory
• Matrices with the Edmonds-Johnson property
• On maximal independent sets of vertices in claw-free graphs
• On the cut polyhedron.
• Packing cycles in graphs
• Solving the feedback vertex set problem on undirected graphs
• Stability critical graphs and even subdivisions of \(K_ 4\)
• Stability critical graphs and ranks facets of the stable set polytope
• The Schrijver system of odd join polyhedra
• The Steiner tree polytope and related polyhedra
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The rank facets of the stable set polytope for claw-free graphs
• Tree polytope on 2-trees

Cited in

(1)

• A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs

This page was built for publication: On the feedback vertex set polytope of a series-parallel graph

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