The complexity of finding uniform sparsest cuts in various graph classes

DOI10.1016/j.jda.2011.12.008zbMath1248.05208OpenAlexW1969061616MaRDI QIDQ450559

Paul Bonsma, Viresh Patel, Hajo J. Broersma, Artem V. Pyatkin

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.008

zbMATH Keywords

treewidthclique-widthparameterized complexitysparsest cutunit interval graph

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)

Related Items (3)

A study on modularity density maximization: column generation acceleration and computational complexity analysis ⋮ Solving cut-problems in quadratic time for graphs with bounded treewidth ⋮ Combinatorial Fiedler theory and graph partition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering large graphs via the singular value decomposition
• Sparsest cuts and bottlenecks in graphs
• NP-hardness of Euclidean sum-of-squares clustering
• Sparsest cuts and concurrent flows in product graphs.
• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of graphs
• Parametrized complexity theory.
• Approximating clique-width and branch-width
• The Complexity Status of Problems Related to Sparsest Cuts
• $O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Linear time algorithms for finding sparsest cuts in various graph classes
• Approximating Sparsest Cut in Graphs of Bounded Treewidth
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Depth-First Search and Linear Graph Algorithms
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
• Expander flows, geometric embeddings and graph partitioning

This page was built for publication: The complexity of finding uniform sparsest cuts in various graph classes