The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree.
Marco BressanMatthias LanzingerMarc RothPublished in: STOC (2023)
Keyphrases
- directed graph
- random walk
- directed acyclic graph
- pattern matching
- undirected graph
- database
- machine learning
- strongly connected
- maximum flow
- computational complexity
- pattern detection
- graph structure
- disjoint paths
- space complexity
- graphical models
- computational cost
- special case
- image sequences
- knowledge base
- real time