, triangle)-free graphs in polynomial time.
Andreas BrandstädtRaffaele MoscaPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- graph isomorphism
- bounded treewidth
- planar graphs
- polynomial time complexity
- approximation algorithms
- special case
- worst case
- graph theoretic
- computational complexity
- graph matching
- graph mining
- undirected graph
- weighted graph
- neural network
- graph databases
- graph representation
- np complete
- semi supervised
- graph structure
- graph construction
- graph search
- subgraph isomorphism
- series parallel
- pattern recognition
- image segmentation
- genetic algorithm