The complexity of finding uniform sparsest cuts in various graph classes (2012)

First Author: Bonsma P
Attributed to:  Structural Vulnerability Measures for Networks and Graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.jda.2011.12.008

Publication URI: http://dx.doi.org/10.1016/j.jda.2011.12.008

Type: Journal Article/Review

Parent Publication: Journal of Discrete Algorithms