Symbolic graphs: Linear solutions to connectivity related problems
From MaRDI portal
(Redirected from Publication:2471809)
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1220670 (Why is no real title available?)
- scientific article; zbMATH DE number 1351076 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 2079387 (Why is no real title available?)
- scientific article; zbMATH DE number 1390338 (Why is no real title available?)
- Algorithms and Computation
- Algorithms and Computation
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- BDDs -- design, analysis, complexity, and applications.
- Binary Decision Diagrams
- Binary decision diagrams in theory and practice
- Bisimulation minimization and symbolic model checking
- Depth-First Search and Linear Graph Algorithms
- Graph-Based Algorithms for Boolean Function Manipulation
- Graph-Theoretic Concepts in Computer Science
- Improving the variable ordering of OBDDs is NP-complete
- Mathematical Foundations of Computer Science 2003
- SOFSEM 2004: Theory and Practice of Computer Science
- Symbolic model checking: \(10^{20}\) states and beyond
- Testing language containment for \(\omega\)-automata using BDDs
- The nonapproximability of OBDD minimization
- Verification of reactive systems. Formal methods and algorithms.
Cited in
(27)- How to determine the solvability of bond graph linear junction structures
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
- scientific article; zbMATH DE number 7566051 (Why is no real title available?)
- Larger lower bounds on the OBDD complexity of integer multiplication
- Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
- Symbolic coloured SCC decomposition
- Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
- scientific article; zbMATH DE number 5177458 (Why is no real title available?)
- Fine-grained complexity lower bounds for problems in computer aided verification
- Mathematical Foundations of Computer Science 2003
- scientific article; zbMATH DE number 2079387 (Why is no real title available?)
- On the OBDD representation of some graph classes
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- Implicit computation of maximum bipartite matchings by sublinear functional operations
- On efficient implicit OBDD-based algorithms for maximal matchings
- Representation of graphs and its algorithms based on BDD
- Implicit computation of maximum bipartite matchings by sublinear functional operations
- Exponential space complexity for OBDD-based reachability analysis
- Randomized OBDD-based graph algorithms
- Randomized OBDD-based graph algorithms
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- On the size of (generalized) OBDDs for threshold functions
- Algorithms and Computation
- A truly symbolic linear-time algorithm for SCC decomposition
- Graph-Theoretic Concepts in Computer Science
- Priority functions for the approximation of the metric TSP
- Symbolic topological sorting with OBDDs
This page was built for publication: Symbolic graphs: Linear solutions to connectivity related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471809)
