On the OBDD size for graphs of bounded tree- and clique-width
type: Item
instance of: scholarly article
title: On the OBDD size for graphs of bounded tree- and clique-width
zbMATH Open document ID: 1177.68100
author: Klaus Meer
author: Dieter Rautenbach
published in: Discrete Mathematics
publication date: 2009-04-09T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5542379
zbMATH Keywords: decision diagram
zbMATH Keywords: ordered binary decision diagram
zbMATH Keywords: tree-width
zbMATH Keywords: clique-width
zbMATH Keywords: cograph
MaRDI profile type: Publication
full work available at URL: j.disc.2008.01.022
OpenAlex ID: W2087617949
cites work: Easy problems for tree-decomposable graphs
cites work: On the size of binary decision diagrams representing Boolean functions
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Complement reducible graphs
cites work: Q4273871
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Upper bounds to the clique width of graphs
cites work: Q4947393
cites work: Q4267798
cites work: Q4471346
cites work: Algorithms and Computation
cites work: Implicat Representation of Graphs
cites work: Short encodings of planar graphs and maps
cites work: Succinct representation of general unlabeled graphs
cites work: SOFSEM 2004: Theory and Practice of Computer Science
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Representing graphs implicitly using almost optimal space
cites work: Branching Programs and Binary Decision Diagrams
cites work: BDDs -- design, analysis, complexity, and applications.
cites work: Symbolic topological sorting with OBDDs
DOI: 10.1016/J.DISC.2008.01.022
description: scientific article; zbMATH DE number 5542379