Finding all leftmost separators of size \(\le k\)

DOI10.1007/978-3-030-92681-6_23OpenAlexW4206641069MaRDI QIDQ2149878

Mahdi Belbasi, Martin Fuerer

Publication date: 29 June 2022

Full work available at URL: https://arxiv.org/abs/2111.02614

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Parameterized graph separation problems
• Clustering with local restrictions
• An improvement of Reed's treewidth approximation
• Parametrized complexity theory.
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• A $c^k n$ 5-Approximation Algorithm for Treewidth
• Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
• Complexity of Finding Embeddings in a k-Tree
• Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset

This page was built for publication: Finding all leftmost separators of size \(\le k\)