The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections.
Lucas GneccoNicolas BoriaSébastien BougleuxFlorian YgerDavid B. BlumenthalPublished in: SISAP (2021)
Keyphrases
- spanning tree
- minimum weight
- edge disjoint
- random walk
- connected dominating set
- graph representation
- dominating set
- graph model
- minimum spanning tree
- digital libraries
- weighted graph
- bipartite graph
- graph theory
- data sets
- data collections
- graph structure
- graph mining
- data compression
- graph matching
- directed graph
- structured data
- metadata
- graph databases
- document collections
- graph theoretic
- np complete
- graphical models
- graph construction
- graph structures
- constant factor
- special case
- bayesian networks
- information retrieval