Finding small balanced separators
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Approximation algorithms (68W25)
Recommendations
- Approximating small balanced vertex separators in almost linear time
- Approximating small balanced vertex separators in almost linear time
- A Heuristic Algorithm for Small Separators in Arbitrary Graphs
- Finding good approximate vertex and edge partitions is NP-hard
- Fast Approximate Graph Partitioning Algorithms
Cited in
(28)- Finding good approximate vertex and edge partitions is NP-hard
- On classes of graphs with strongly sublinear separators
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
- Solution methods for the vertex variant of the network system vulnerability analysis problem
- Linear kernels for separating a graph into components of bounded size
- On treewidth, separators and Yao's garbling
- How to Cut a Graph into Many Pieces
- A Heuristic Algorithm for Small Separators in Arbitrary Graphs
- Algorithms for Multiterminal Cuts
- Partitioning a graph into small pieces with applications to path transversal
- Minimum bisection is fixed-parameter tractable
- Detecting a Network Failure
- On the parameterized complexity of finding separators with non-hereditary properties
- Brief announcement: Bounded-degree cut is fixed-parameter tractable
- scientific article; zbMATH DE number 7626718 (Why is no real title available?)
- The Valve Location Problem in Simple Network Topologies
- Approximating small balanced vertex separators in almost linear time
- Approximating small balanced vertex separators in almost linear time
- Customizable hub labeling: properties and algorithms
- Fission: Practical algorithms for computing minimum balanced node separators
- Operational causality -- necessarily sufficient and sufficiently necessary
- Faster exponential-time approximation algorithms using approximate monotone local search
- Hardness of finding combinatorial shortest paths on graph associahedra
- Cuts in graphs with matroid constraints
- Property testing in Gaussian graphical models: trees and small separation numbers
- All-subsets important separators with applications to sample sets, balanced separators and vertex sparsifiers in directed graphs
- Most balanced minimum cuts
- Simple and improved parameterized algorithms for multiterminal cuts
This page was built for publication: Finding small balanced separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931401)
