On the feedback vertex set polytope of a series-parallel graph
From MaRDI portal
Publication:834183
DOI10.1016/J.DISOPT.2009.01.004zbMATH Open1167.90665OpenAlexW2065255395MaRDI QIDQ834183FDOQ834183
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
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
- Title not available (Why is that?)
- Matching theory
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- Tree polytope on 2-trees
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Easy problems for tree-decomposable graphs
- Title not available (Why is that?)
- On maximal independent sets of vertices in claw-free graphs
- The Steiner tree polytope and related polyhedra
- The rank facets of the stable set polytope for claw-free graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Stability critical graphs and ranks facets of the stable set polytope
- Packing cycles in graphs
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- On the cut polyhedron.
- Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
- Matrices with the Edmonds-Johnson property
- Title not available (Why is that?)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- The Schrijver system of odd join polyhedra
- Covering a symmetric poset by symmetric chains
- Stability critical graphs and even subdivisions of \(K_ 4\)
- Algorithms and computations. 6th international symposium, ISAAC '95, Cairns, Australia, December 4--6, 1995. Proceedings
- Solving the feedback vertex set problem on undirected graphs
- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
Cited In (1)
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)
