On the Boolean-Width of a Graph: Structure and Applications
type: Item
instance of: scholarly article
title: On the Boolean-Width of a Graph: Structure and Applications
zbMATH Open document ID: 1310.05193
DOI: 10.1007/978-3-642-16926-7_16
author: Isolde Adler
author: Binh-Minh Bui-Xuan
author: Yuri Rabinovich
author: Gabriel Renault
author: Jan Arne Telle
author: Martin Vatshelle
published in: Graph Theoretic Concepts in Computer Science
publication date: 2010-11-16T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5816316
describes a project that uses: ComputeTW
MaRDI profile type: Publication
full work available at URL: 978-3-642-16926-7 16
OpenAlex ID: W1881512968
cites work: Treewidth computations. I: Upper bounds
cites work: Boolean-Width of Graphs
cites work: \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
cites work: On the Relationship Between Clique-Width and Treewidth
cites work: Q4385531
cites work: Dynamic Programming and Fast Matrix Multiplication
cites work: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
cites work: Q4489221
cites work: Vertex-minor reductions can simulate edge contractions
cites work: Q3958592
cites work: Edge dominating set and colorings on graphs with fixed clique-width
cites work: Rank-width of random graphs
cites work: Q4856179
cites work: Rank‐width is less than or equal to branch‐width
cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
description: scientific article