, Triangle)-Free Graphs in Polynomial Time.
Andreas BrandstädtRaffaele MoscaPublished in: CoRR (2018)
Keyphrases
- graph isomorphism
- special case
- polynomial time complexity
- graph representation
- bounded treewidth
- graph theoretic
- planar graphs
- graph matching
- random graphs
- graph theory
- graph model
- structured objects
- graph databases
- graph mining
- approximation algorithms
- np complete
- worst case
- computational complexity
- objective function
- weighted graph
- graph clustering
- finite automata
- directed graph
- pattern recognition