On the feedback vertex set problem in permutation graphs
From MaRDI portal
Recommendations
Cites work
- A new approach for the domination problem on permutation graphs
- An O(N + M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph
- An efficient algorithm for maxdominance, with applications
- Connected domination and Steiner set on weighted permutation graphs
- Dominating sets in perfect graphs
- Domination in permutation graphs
- Finding a minimum independent dominating set in a permutation graph
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 512913 (Why is no real title available?)
- On Comparability and Permutation Graphs
- On domination problems for permutation and other graphs
- Permutation graphs: Connected domination and Steiner trees
- Transitive Orientation of Graphs and Identification of Permutation Graphs
Cited in
(25)- Minimum feedback vertex sets in shuffle-based interconnection networks
- A linear time algorithm for the minimum weighted feedback vertex set on diamonds
- Almost exact minimum feedback vertex set in meshes and butterflies
- Degenerate matchings and edge colorings
- On the complexity of singly connected vertex deletion
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles
- Feedback vertex sets in mesh-based networks
- New upper bounds on feedback vertex numbers in butterflies
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- The decycling number of P_m P^_n
- Feedback vertex set in hypercubes
- Induced Forests in Regular Graphs with Large Girth
- scientific article; zbMATH DE number 4041287 (Why is no real title available?)
- scientific article; zbMATH DE number 512913 (Why is no real title available?)
- New bounds on the decycling number of generalized de Bruijn digraphs
- On the decycling number of generalized Kautz digraphs
- On the Complexity of Singly Connected Vertex Deletion
- A space-time tradeoff for permutation problems
- scientific article; zbMATH DE number 2230267 (Why is no real title available?)
- Connected feedback vertex set on AT-free graphs
- Connected feedback vertex set on AT-free graphs
- Enumerating minimum feedback vertex sets in directed graphs with union-cat trees
- Feedback numbers of Kautz digraphs
- Feedback vertex set on AT-free graphs
- Feedback numbers of de Bruijn digraphs
This page was built for publication: On the feedback vertex set problem in permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338778)
