Randomized OBDD-Based Graph Algorithms (Q3460720): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SparseMatrix / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-25258-2_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2295004524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Constructions of Almost k-wise Independent Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / 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 symbolic OBDD-based algorithms for the minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority functions for the approximation of the metric TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations / 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 efficient implicit OBDD-based algorithms for maximal matchings / 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: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of two-point based sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471346 / 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: OBDD-Based Representation of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy of contact circuits and lower bounds on their complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost \(k\)-wise independence and hard Boolean functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / 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: An optimal bit complexity randomized distributed MIS algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of graphs by OBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved boolean formulas for the Ramsey graphs / 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: SOFSEM 2006: 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: The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic topological sorting with OBDDs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:59, 11 July 2024

scientific article
Language Label Description Also known as
English
Randomized OBDD-Based Graph Algorithms
scientific article

    Statements

    Randomized OBDD-Based Graph Algorithms (English)
    0 references
    0 references
    8 January 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references