Login / Signup

The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree.

Marco BressanMatthias LanzingerMarc Roth
Published in: CoRR (2022)
Keyphrases
  • directed graph
  • random walk
  • worst case
  • directed acyclic graph
  • undirected graph
  • maximum flow
  • databases
  • information retrieval
  • computational complexity
  • pattern matching
  • data mining
  • graph structure
  • complexity analysis