andom walks and forbidden minors II: A $\poly(d\eps^{-1})$-query tester for minor-closed properties of bounded degree graphs.
Akash KumarC. SeshadhriAndrew StolmanPublished in: Electron. Colloquium Comput. Complex. (2019)
Keyphrases
- bounded degree
- graph theoretic
- query processing
- query evaluation
- data structure
- graph properties
- response time
- database
- bounded treewidth
- user queries
- graph matching
- social networks
- itemsets
- np complete
- data sources
- test cases
- data management
- relevance feedback
- dynamic programming
- domain knowledge
- special case
- database systems