Sparsification of Balanced Directed Graphs

Panigrahi Debmalya
Panigrahi Debmalya
Sun Kevin
Sun Kevin
Cited by: 0|Bibtex|Views0|Links

Abstract:

Sparsification, where the cut values of an input graph are approximately preserved by a sparse graph (called a cut sparsifier) or a succinct data structure (called a cut sketch), has been an influential tool in graph algorithms. But, this tool is restricted to undirected graphs, because some directed graphs are known to not admit sparsi...More

Code:

Data:

Your rating :
0

 

Tags
Comments