The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version].
Lucas GneccoNicolas BoriaSébastien BougleuxFlorian YgerDavid B. BlumenthalPublished in: CoRR (2021)
Keyphrases
- minimum weight
- spanning tree
- random walk
- edge disjoint
- minimum spanning tree
- dominating set
- graph representation
- minimum cost
- graph model
- graph structure
- information retrieval
- minimum cut
- data compression
- graph theory
- digital libraries
- connected dominating set
- directed graph
- undirected graph
- stable set
- structured data
- lower bound
- constant factor
- data sets
- metadata
- multiple versions
- graph based algorithm
- digital collections
- maximum flow
- graph theoretic
- connected components
- graph matching
- weighted graph
- bipartite graph