Finding a maximum independent set in a permutation graph
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3321957 (Why is no real title available?)
- scientific article; zbMATH DE number 3332248 (Why is no real title available?)
- A characterization of perfect graphs
- Bipartite permutation graphs
- Domination in permutation graphs
- Finding minimum dominating cycles in permutation graphs
- On Comparability and Permutation Graphs
- On testing isomorphism of permutation graphs
- Permutation Graphs and Transitive Graphs
- Transitive Orientation of Graphs and Identification of Permutation Graphs
Cited in
(11)- The bottleneck independent domination on the classes of bipartite graphs and block graphs.
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- On a graph partition problem with application to VLSI layout
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs
- Bounds on 2-point set domination number of a graph
- On approximating MIS over B1-VPG graphs*
- Maximum weightk-independent set problem on permutation graphs
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
- MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS
- Finding a maximum matching in a permutation graph
- Complete edge-colored permutation graphs
This page was built for publication: Finding a maximum independent set in a permutation graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916397)
