Dominating Induced Matchings for P 7-Free Graphs in Linear Time.
Andreas BrandstädtRaffaele MoscaPublished in: Algorithmica (2014)
Keyphrases
- maximum cardinality
- bipartite graph
- graph theoretic
- worst case
- structured objects
- graph representation
- directed graph
- real time
- series parallel
- graph model
- knowledge base
- graph mining
- graph structure
- spanning tree
- computational complexity
- bayesian networks
- graph clustering
- subgraph isomorphism
- case study
- graph isomorphism
- database