A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width.
Lars JaffkeO-joung KwonJan Arne TellePublished in: CoRR (2017)
Keyphrases
- worst case
- computational complexity
- k means
- vertex set
- learning algorithm
- polynomial time complexity
- graph theoretic
- objective function
- graph isomorphism
- graph structure
- np hard
- undirected graph
- random graphs
- dynamic programming
- search space
- tree structure
- matching algorithm
- frequent patterns
- spanning tree
- probabilistic model
- subgraph isomorphism