Sparsification lower bound for linear spanners in directed graphs.
Prafullkumar TalePublished in: Theor. Comput. Sci. (2022)
Keyphrases
- directed graph
- lower bound
- upper bound
- random walk
- graph structure
- directed acyclic graph
- objective function
- maximum flow
- np hard
- branch and bound algorithm
- optimal solution
- web graph
- worst case
- undirected graph
- branch and bound
- lower and upper bounds
- polynomial approximation
- closed form
- sufficiently accurate
- learning algorithm
- linear programming
- least squares
- data structure
- reinforcement learning