SOFSEM 2004: Theory and Practice of Computer Science

DOI10.1007/b95046zbMath1202.68288OpenAlexW2916538296MaRDI QIDQ5902005

Daniel Sawitzki

Publication date: 4 June 2009

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Randomized OBDD-based graph algorithms ⋮ Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations ⋮ Lower bounds on the OBDD size of two fundamental functions' graphs ⋮ On the OBDD representation of some graph classes ⋮ Randomized OBDD-Based Graph Algorithms ⋮ Exponential space complexity for OBDD-based reachability analysis ⋮ 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 ⋮ Symbolic topological sorting with OBDDs ⋮ Symbolic graphs: Linear solutions to connectivity related problems ⋮ Representation of graphs by OBDDs ⋮ On the OBDD size for graphs of bounded tree- and clique-width ⋮ On the width of regular classes of finite structures