Randomized OBDD-Based Graph Algorithms (Q3460720)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Randomized OBDD-Based Graph Algorithms (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-25258-2_18

0 references

0 references

Structural Information and Communication Complexity

0 references

publication date

8 January 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-25258-2_18

0 references

0 references

A fast and simple randomized parallel algorithm for the maximal independent set problem

0 references

Simple Constructions of Almost k-wise Independent Random Variables

0 references

The space complexity of approximating the frequency moments

0 references

An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps

0 references

On symbolic OBDD-based algorithms for the minimum spanning tree problem

0 references

Priority functions for the approximation of the metric TSP

0 references

Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations

0 references

On the effect of local changes in the variable ordering of ordered decision diagrams

0 references

On efficient implicit OBDD-based algorithms for maximal matchings

0 references

Graph-Based Algorithms for Boolean Function Manipulation

0 references

Symbolic model checking: \(10^{20}\) states and beyond

0 references

On the power of two-point based sampling

0 references

0 references

The university of Florida sparse matrix collection

0 references

0 references

Symbolic graphs: Linear solutions to connectivity related problems

0 references

OBDD-Based Representation of Interval Graphs

0 references

A fast and simple randomized parallel algorithm for maximal matching

0 references

Entropy of contact circuits and lower bounds on their complexity

0 references

Almost \(k\)-wise independence and hard Boolean functions.

0 references

Locality in Distributed Graph Algorithms

0 references

A Simple Parallel Algorithm for the Maximal Independent Set Problem

0 references

On the OBDD size for graphs of bounded tree- and clique-width

0 references

An optimal bit complexity randomized distributed MIS algorithm

0 references

Small-Bias Probability Spaces: Efficient Constructions and Applications

0 references

Representation of graphs by OBDDs

0 references

Improved boolean formulas for the Ramsey graphs

0 references

SOFSEM 2004: Theory and Practice of Computer Science

0 references

SOFSEM 2006: Theory and Practice of Computer Science

0 references

Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms

0 references

The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions

0 references

Branching Programs and Binary Decision Diagrams

0 references

Symbolic topological sorting with OBDDs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3460720

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3460720&oldid=36222536"