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

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

Revision as of 12:51, 5 July 2024

scientific article
Language Label Description Also known as
English
On symbolic OBDD-based algorithms for the minimum spanning tree problem
scientific article

    Statements

    On symbolic OBDD-based algorithms for the minimum spanning tree problem (English)
    0 references
    0 references
    13 August 2012
    0 references
    minimum spanning tree algorithms
    0 references
    ordered binary decision diagrams
    0 references
    symbolic algorithms
    0 references
    transitive closure
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references