Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs.
Charis PapadopoulosSpyridon TzimasPublished in: FCT (2017)
Keyphrases
- vertex set
- polynomial time complexity
- graph isomorphism
- graph theory
- random graphs
- weighted graph
- data structure
- graph mining
- computational complexity
- worst case
- undirected graph
- planar graphs
- maximal cliques
- frequent patterns
- graph data
- graph matching
- graph search
- graph structures
- np complete
- dynamic graph
- learning algorithm
- graph theoretic
- complex networks
- directed graph
- bipartite graph
- approximation algorithms