On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.11.029
@@ Property / DOI: 10.1016/j.tcs.2011.11.029 / rank @@
-Normal rank
@@ Property / cites work @@
+Q4694758
@@ Property / cites work: Q4694758 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-weight spanning tree algorithms. A survey and empirical study
+Normal rank
@@ Property / cites work @@
+An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
+Normal rank
@@ Property / cites work @@
+On the OBDD Complexity of the Most Significant Bit of Integer Multiplication
+Normal rank
@@ Property / cites work @@
+Exponential space complexity for OBDD-based reachability analysis
+Normal rank
@@ Property / cites work @@
+Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks
+Normal rank
@@ Property / cites work @@
+On Symbolic Representations of Maximum Matchings and (Un)directed Graphs
+Normal rank
@@ Property / cites work @@
+On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
+Normal rank
@@ Property / cites work @@
+On the effect of local changes in the variable ordering of ordered decision diagrams
+Normal rank
@@ Property / cites work @@
+On the size of binary decision diagrams representing Boolean functions
+Normal rank
@@ Property / cites work @@
+Graph-Based Algorithms for Boolean Function Manipulation
+Normal rank
@@ Property / cites work @@
+On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
+Normal rank
@@ Property / cites work @@
+Symbolic model checking: \(10^{20}\) states and beyond
+Normal rank
@@ Property / cites work @@
+A minimum spanning tree algorithm with inverse-Ackermann type complexity
+Normal rank
@@ Property / cites work @@
+Finding Minimum Spanning Trees
@@ Property / cites work: Finding Minimum Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Bisimulation minimization and symbolic model checking
+Normal rank
@@ Property / cites work @@
+Succinct representations of graphs
@@ Property / cites work: Succinct representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471346
@@ Property / cites work: Q4471346 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic graphs: Linear solutions to connectivity related problems
+Normal rank
@@ Property / cites work @@
+On the History of the Minimum Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Q4472250
@@ Property / cites work: Q4472250 / rank @@
+Normal rank
@@ Property / cites work @@
+Implicat Representation of Graphs
@@ Property / cites work: Implicat Representation of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A randomized linear-time algorithm to find minimum spanning trees
+Normal rank
@@ Property / cites work @@
+On the OBDD size for graphs of bounded tree- and clique-width
+Normal rank
@@ Property / cites work @@
+Representation of graphs by OBDDs
@@ Property / cites work: Representation of graphs by OBDDs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on succinct representations of graphs
@@ Property / cites work: A note on succinct representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal minimum spanning tree algorithm
@@ Property / cites work: An optimal minimum spanning tree algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+SOFSEM 2004: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
+Normal rank
@@ Property / cites work @@
+SOFSEM 2006: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Reduction of OBDDs in linear time
@@ Property / cites work: Reduction of OBDDs in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Representing graphs implicitly using almost optimal space
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic topological sorting with OBDDs
@@ Property / cites work: Symbolic topological sorting with OBDDs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.11.029
@@ Property / DOI: 10.1016/J.TCS.2011.11.029 / rank @@
+Normal rank