SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257zbMath1175.68206OpenAlexW2756057450MaRDI QIDQ5897999

Daniel Sawitzki

Publication date: 14 November 2006

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (10)

Randomized OBDD-based graph algorithms ⋮ Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations ⋮ On the OBDD representation of some graph classes ⋮ Randomized OBDD-Based Graph Algorithms ⋮ On the OBDD Complexity of the Most Significant Bit of Integer Multiplication ⋮ On symbolic OBDD-based algorithms for the minimum spanning tree problem ⋮ Priority functions for the approximation of the metric TSP ⋮ On efficient implicit OBDD-based algorithms for maximal matchings ⋮ Implicit computation of maximum bipartite matchings by sublinear functional operations ⋮ On the minimization of (complete) ordered binary decision diagrams

This page was built for publication: SOFSEM 2006: Theory and Practice of Computer Science