Sparsification Lower Bound for Linear Spanners in Directed Graphs.
Prafullkumar TalePublished in: CoRR (2022)
Keyphrases
- directed graph
- lower bound
- upper bound
- random walk
- branch and bound algorithm
- maximum flow
- objective function
- branch and bound
- lower and upper bounds
- graph structure
- directed acyclic graph
- undirected graph
- worst case
- optimal solution
- bayesian networks
- strongly connected
- shortest path
- linear systems
- sufficiently accurate