-free graphs in polynomial time.
Andreas BrandstädtRaffaele MoscaPublished in: Discuss. Math. Graph Theory (2022)
Keyphrases
- graph isomorphism
- special case
- polynomial time complexity
- bounded treewidth
- approximation algorithms
- graph theoretic
- computational complexity
- planar graphs
- series parallel
- graph matching
- graph representation
- finite automata
- graph construction
- graph databases
- graph mining
- graph partitioning
- data sets
- graph theory
- greedy algorithm
- directed graph
- social network analysis
- worst case
- neural network