Boolean-width of graphs
type: Item
instance of: scholarly article
title: Boolean-width of graphs
zbMATH Open document ID: 1225.68133
author: Binh-Minh Bui-Xuan
author: Jan Arne Telle
author: Martin Vatshelle
published in: Theoretical Computer Science
publication date: 2011-10-10T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5955879
zbMATH Keywords: graph decomposition
zbMATH Keywords: FPT algorithm
zbMATH Keywords: width parameter
zbMATH Keywords: Boolean algebra
describes a project that uses: ComputeTW
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.05.022
OpenAlex ID: W2154682992
cites work: On the Boolean-Width of a Graph: Structure and Applications
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Approximation algorithms for treewidth
cites work: Graph Classes with Structured Neighborhoods and Algorithmic Applications
cites work: Treewidth computations. I: Upper bounds
cites work: Faster Algorithms on Branch and Clique Decompositions
cites work: Feedback Vertex Set on Graphs of Low Cliquewidth
cites work: \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
cites work: On the Relationship Between Clique-Width and Treewidth
cites work: Handle-rewriting hypergraph grammars
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Q4938660
cites work: Q4503944
cites work: Parametrized complexity theory.
cites work: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
cites work: Branch-width and well-quasi-ordering in matroids and graphs.
cites work: Q5592270
cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
cites work: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
cites work: Finding Branch-Decompositions and Rank-Decompositions
cites work: Decomposition of perfect graphs
cites work: Finding Good Decompositions for Dynamic Programming on Dense Graphs
cites work: The Rank-Width of the Square Grid
cites work: Q4489221
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: Graph-Theoretic Concepts in Computer Science
cites work: Rank‐width is less than or equal to branch‐width
cites work: Approximating clique-width and branch-width
cites work: Clique-width of graphs defined by one-vertex extensions
cites work: Q4352948
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
cites work: Row space cardinalities
DOI: 10.1016/J.TCS.2011.05.022
Wikidata QID: Q131629058
Recommended article: Boolean-Width of Graphs
Recommended article: On the Boolean-Width of a Graph: Structure and Applications
Recommended article: Q3798717
Recommended article: On the Boolean dimension of a graph and other related parameters
Recommended article: Boolean dimension and tree-width
Recommended article: Q5187327
Recommended article: Boolean graphs - A survey
Recommended article: On the bit gaph of Boolean vectors
Recommended article: Q4781610
Recommended article: Boolean planarity characterization of graphs
description: scientific article; zbMATH DE number 5955879