The minimum k-storage problem on directed graphs.
Gianlorenzo D'AngeloDaniele DiodatiAlfredo NavarraCristina M. PinottiPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- directed graph
- random walk
- directed acyclic graph
- graph structure
- data storage
- storage space
- undirected graph
- graph structures
- disjoint paths
- storage and retrieval
- storage requirements
- directed edges
- strongly connected
- special case
- spanning tree
- graphical models
- storage devices
- computational complexity
- storage systems
- search algorithm
- web pages
- machine learning