PDF) Two Arc-Disjoint Paths in Eulerian Digraphs
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
Sebastian Forster (University of Salzburg)
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Dataset/DBLP_DataSet.txt at master · MAK660/Dataset · GitHub
Kanat Tangwongsan's 46 research works in Philosophy and Social Science
PDF) HOPS: Probabilistic Subtree Mining for Small and Large Graphs
Michal Valko's 96 research works in Psychology
Ioannis Koutis's 53 research works in Medicine and Political Science
Spectral Algorithms for Temporal Graph Cuts
Ioannis Koutis's 53 research works in Medicine and Political Science
Kanat Tangwongsan's 46 research works in Philosophy and Social Science
Ioannis Koutis's 53 research works in Medicine and Political Science
Ioannis Koutis's 53 research works in Medicine and Political Science
Sebastian Forster (University of Salzburg)
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams | ACM Transactions on Knowledge Discovery from Data
PDF) Locating highly connected clusters in large networks with HyperLogLog counters
PDF) Towards the effective parallel computation of matrix pseudospectra.
lowerbounds-survey/references.bib at master · dasarpmar/lowerbounds-survey · GitHub
