Approximating Min-Mean-Cycle for low-diameter graphs in near-optimal time and memory.
Jason M. AltschulerPablo A. ParriloPublished in: CoRR (2020)
Keyphrases
- graph matching
- memory size
- graph theoretic
- memory space
- memory requirements
- random access
- graph databases
- graph representation
- undirected graph
- computing power
- limited memory
- graph theory
- series parallel
- average degree
- pruning power
- graph mining
- graph construction
- graph structures
- adjacency matrix
- subgraph isomorphism
- low memory