Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size.
Alessio ConteRoberto GrossiYasuaki KobayashiKazuhiro KuritaDavide RucciTakeaki UnoKunihiro WasaPublished in: CoRR (2024)
Keyphrases
- worst case
- space complexity
- computational complexity
- bounded treewidth
- maximal cliques
- memory requirements
- maximum clique
- random walk
- graph structure
- structured data
- graph matching
- graph theory
- dependency graph
- block size
- graph databases
- graph model
- neural network
- directed graph
- connected components
- bipartite graph
- space requirements
- network size
- causal graph
- decision problems
- upper bound
- xml documents
- graph based algorithm
- polynomial size
- objective function