Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs.
Charis PapadopoulosSpyridon TzimasPublished in: Discret. Appl. Math. (2019)
Keyphrases
- vertex set
- graph isomorphism
- graph theory
- random graphs
- computational complexity
- polynomial time complexity
- graph search
- special case
- graph mining
- planar graphs
- data structure
- worst case
- learning algorithm
- graph theoretic
- connected graphs
- fixed parameter tractable
- graph data
- undirected graph
- graph structure
- pattern mining
- graphical models