Finding dominating induced matchings in P10-free graphs in polynomial time.
Andreas BrandstädtRaffaele MoscaPublished in: Theor. Comput. Sci. (2024)
Keyphrases
- graph isomorphism
- polynomial time complexity
- maximum clique
- special case
- graph matching
- graph structure
- maximum cardinality
- random graphs
- graph representation
- approximation algorithms
- computational complexity
- graph theory
- graph model
- spanning tree
- pattern mining
- graph clustering
- np complete
- graph structures
- clustering algorithm
- neural network
- data sets