On symbolic OBDD-based algorithms for the minimum spanning tree problem
From MaRDI portal
Recommendations
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- An algebraic framework for minimum spanning tree problems
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem
- On obligation rules for minimum cost spanning tree problems
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
- A new algorithm for the minimum spanning tree verification problem
- Exact algorithms for finding constrained minimum spanning trees
- On the simultaneous minimum spanning trees problem
- A generalization of obligation rules for minimum cost spanning tree problems
- An optimization algorithm for solving degree-constrained minimum spanning tree problems
Cites work
- scientific article; zbMATH DE number 2079387 (Why is no real title available?)
- scientific article; zbMATH DE number 2080057 (Why is no real title available?)
- scientific article; zbMATH DE number 219271 (Why is no real title available?)
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A note on succinct representations of graphs
- A randomized linear-time algorithm to find minimum spanning trees
- Algorithms and Computation
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- An optimal minimum spanning tree algorithm
- Bisimulation minimization and symbolic model checking
- Branching Programs and Binary Decision Diagrams
- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
- Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks
- Exponential space complexity for OBDD-based reachability analysis
- Finding Minimum Spanning Trees
- Graph-Based Algorithms for Boolean Function Manipulation
- Graph-Theoretic Concepts in Computer Science
- Implicat Representation of Graphs
- Mathematical Foundations of Computer Science 2003
- Minimum-weight spanning tree algorithms. A survey and empirical study
- On symbolic representations of maximum matchings and (Un)directed graphs
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
- On the History of the Minimum Spanning Tree Problem
- On the OBDD Complexity of the Most Significant Bit of Integer Multiplication
- On the OBDD size for graphs of bounded tree- and clique-width
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- On the effect of local changes in the variable ordering of ordered decision diagrams
- On the size of binary decision diagrams representing Boolean functions
- Reduction of OBDDs in linear time
- Representation of graphs by OBDDs
- Representing graphs implicitly using almost optimal space
- SOFSEM 2004: Theory and Practice of Computer Science
- SOFSEM 2006: Theory and Practice of Computer Science
- Succinct representations of graphs
- Symbolic graphs: Linear solutions to connectivity related problems
- Symbolic model checking: \(10^{20}\) states and beyond
- Symbolic topological sorting with OBDDs
Cited in
(6)- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- On the OBDD representation of some graph classes
- On the width of regular classes of finite structures
- Randomized OBDD-based graph algorithms
- Randomized OBDD-based graph algorithms
- Priority functions for the approximation of the metric TSP
This page was built for publication: On symbolic OBDD-based algorithms for the minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q443706)
