Algorithms and Computation

DOI10.1007/b94771zbMath1205.05220OpenAlexW1769833081MaRDI QIDQ5191684

Alberto Policriti, Raffaella Gentilini

Publication date: 7 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94771

zbMATH Keywords

biconnected componentsordered binary decision diagramgraph sizessymbolic algorithm design

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Connectivity (05C40)

Related Items (4)

Lower bounds on the OBDD size of two fundamental functions' graphs ⋮ On symbolic OBDD-based algorithms for the minimum spanning tree problem ⋮ Symbolic graphs: Linear solutions to connectivity related problems ⋮ On the OBDD size for graphs of bounded tree- and clique-width

This page was built for publication: Algorithms and Computation