Improved approximation algorithms for minimum-weight vertex separators
From MaRDI portal
Cited in
(23)- Nondeterministic graph searching: from pathwidth to treewidth
- General variable neighborhood search for computing graph separators
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
- Approximate search strategies for weighted trees
- Solution methods for the vertex variant of the network system vulnerability analysis problem
- Space-efficient vertex separators for treewidth
- Fréchet embeddings of negative type metrics
- On tree width, bramble size, and expansion
- On treewidth, separators and Yao's garbling
- The vertex attack tolerance of complex networks
- Subexponential parameterized algorithms
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Advances in metric embedding theory
- Approximating small balanced vertex separators in almost linear time
- Approximate max-flow min-multicut theorem for graphs of bounded treewidth
- Approximation algorithms for treewidth, pathwidth, and treedepth -- a short survey
- Bandwidth vs BFS width in matrix reordering, graph reconstruction, and graph drawing
- A note on multiflows and treewidth
- Approximation algorithms for treewidth
- \(\ell ^2_2\) spreading metrics for vertex ordering problems
- Distributed chasing of network intruders
- Linearity of grid minors in treewidth with applications through bidimensionality
- On the complexity of computing treelength
This page was built for publication: Improved approximation algorithms for minimum-weight vertex separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581405)
