New polynomial delay bounds for maximal subgraph enumeration by proximity search.
Alessio ConteTakeaki UnoPublished in: STOC (2019)
Keyphrases
- polynomial delay
- graph mining
- proximity search
- pattern mining
- data complexity
- keyword search
- connected components
- upper bound
- link prediction
- lower bound
- pattern discovery
- community detection
- event sequences
- bregman divergences
- worst case
- image segmentation
- link analysis
- query answering
- databases
- expressive power
- social network analysis
- nearest neighbor
- search engine
- machine learning