Representation of graphs by OBDDs

DOI10.1016/j.dam.2008.02.012zbMath1284.05181OpenAlexW2056386139MaRDI QIDQ1003666

Robin Nunkesser, Philipp Woelfel

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.02.012

zbMATH Keywords

interval graphgraph representationOBDDgraphs with few \(P_{4}\)s

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

Randomized OBDD-based graph algorithms ⋮ On the OBDD representation of some graph classes ⋮ Randomized OBDD-Based Graph Algorithms ⋮ On symbolic OBDD-based algorithms for the minimum spanning tree problem ⋮ On efficient implicit OBDD-based algorithms for maximal matchings

Cites Work

• Unnamed Item
• Unnamed Item
• On the size of binary decision diagrams representing Boolean functions
• Counting unlabeled structures
• Complement reducible graphs
• On a unique tree representation for \(P_ 4\)-extendible graphs
• A tree representation for \(P_ 4\)-sparse graphs
• Symbolic model checking: \(10^{20}\) states and beyond
• The nonapproximability of OBDD minimization
• Counting Coloured Graphs
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• On the OBDD Size for Graphs of Bounded Tree- and Clique-Width
• Graph-Based Algorithms for Boolean Function Manipulation
• Random I‐colorable graphs
• Branching Programs and Binary Decision Diagrams
• Mathematical Foundations of Computer Science 2003
• Coloured Graphs: A Correction and Extension
• Graph-Theoretic Concepts in Computer Science
• Algorithms - ESA 2003
• SOFSEM 2004: Theory and Practice of Computer Science

This page was built for publication: Representation of graphs by OBDDs