Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68352OpenAlexW2495578842MaRDI QIDQ5431355

Philipp Woelfel

Publication date: 7 December 2007

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

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

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items

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 Complexity of Threshold Functions and the Variable Ordering Problem, On the size of (generalized) OBDDs for threshold functions, Representation of graphs by OBDDs