Pages that link to "Item:Q3624379"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for Minimum Weight Vertex Separators (Q3624379):
Displaying 31 items.
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Computing Tree Decompositions (Q5042458) (← links)
- Better algorithms for minimum weight vertex-connectivity problems (Q5048953) (← links)
- An Improvement of Reed’s Treewidth Approximation (Q5049997) (← links)
- (Q5075772) (← links)
- (Q5075776) (← links)
- (Q5091271) (← links)
- PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
- Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)
- Applications of a New Separator Theorem for String Graphs (Q5414146) (← links)
- Near-Optimal Separators in String Graphs (Q5414151) (← links)
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> (Q5501953) (← links)
- On the $AC^0$ Complexity of Subgraph Isomorphism (Q5737815) (← links)
- To Approximate Treewidth, Use Treelength! (Q5741086) (← links)
- (Q5743379) (← links)
- (Q5743430) (← links)
- (Q5743499) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
- (Q5875457) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- Approximating small balanced vertex separators in almost linear time (Q5919618) (← links)
- (Q6062162) (← links)
- Treelength of series-parallel graphs (Q6069145) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
- Fission: Practical algorithms for computing minimum balanced node separators (Q6115756) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Space efficient algorithm for solving reachability using tree decomposition and separators (Q6199388) (← links)
- Structure balance and opinions dynamic in signed social network (Q6594940) (← links)
- Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)
- Finding minimum balanced separators -- an exact approach (Q6606653) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
