On the OBDD Size for Graphs of Bounded Tree- and Clique-Width
From MaRDI portal
Publication:3499725
DOI10.1007/11847250_7zbMath1154.68432OpenAlexW2985721725MaRDI QIDQ3499725
Publication date: 3 June 2008
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11847250_7
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
This page was built for publication: On the OBDD Size for Graphs of Bounded Tree- and Clique-Width
