On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem

DOI10.1007/978-3-642-17461-2_2zbMath1311.05183OpenAlexW1516113858MaRDI QIDQ3066440

Beate Bollig

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_2

zbMATH Keywords

ordered binary decision diagramsminimum spanning tree algorithmssymbolic algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (3)

Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations ⋮ On efficient implicit OBDD-based algorithms for maximal matchings ⋮ Implicit computation of maximum bipartite matchings by sublinear functional operations

This page was built for publication: On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem