On the Maximum Weight Minimal Separator

DOI10.1007/978-3-319-55911-7_22zbMath1435.68238OpenAlexW2601673779WikidataQ59567382 ScholiaQ59567382MaRDI QIDQ2988830

Hirotaka Ono, Tesshu Hanaka, Tom C. van der Zanden, Hans L. Bodlaender

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_22

zbMATH Keywords

treewidthminimal separatorparameterized algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (1)

Computing the largest bond and the maximum connected cut of a graph

Cites Work

• Unnamed Item
• Matching is as easy as matrix inversion
• Treewidth. Computations and approximations
• Listing all potential maximal cliques of a graph
• Treewidth and Minimum Fill-in: Grouping the Minimal Separators
• On the Number of Minimal Separators in Graphs
• Exact Algorithms for Treewidth and Minimum Fill-In
• Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
• Complexity of Finding Embeddings in a k-Tree
• Treewidth of Circular-Arc Graphs
• Treewidth and Pathwidth of Permutation Graphs
• TREEWIDTH OF CIRCLE GRAPHS
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• Parameterized Algorithms
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: On the Maximum Weight Minimal Separator