Mathematical Foundations of Computer Science 2003

DOI10.1007/B11836MaRDI QIDQ5431355zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Symbolic topological sorting with OBDDs
• Symbolic OBDD-based reachability analysis needs exponential space
• Symbolic graphs: Linear solutions to connectivity related problems
• SOFSEM 2005: Theory and Practice of Computer Science
• On symbolic OBDD-based algorithms for the minimum spanning tree problem

Cited in

(7)

• Representation of graphs by OBDDs
• Symbolic topological sorting with OBDDs
• Symbolic graphs: Linear solutions to connectivity related problems
• On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
• On symbolic OBDD-based algorithms for the minimum spanning tree problem
• Lower bounds on the OBDD size of two fundamental functions' graphs
• On the size of (generalized) OBDDs for threshold functions

This page was built for publication: Mathematical Foundations of Computer Science 2003

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5431355)