scientific article; zbMATH DE number 2079387
From MaRDI portal
Publication:4471346
zbMATH Open1092.68716MaRDI QIDQ4471346FDOQ4471346
Authors: Carla Piazza, Alberto Policriti, Raffaella Gentilini 
Publication date: 28 July 2004
Title of this publication is not available (Why is that?)
Recommendations
Cited In (39)
- A simplified correctness proof for a well-known algorithm computing strongly connected components.
- New results on the most significant bit of integer multiplication
- Computing bottom SCCs symbolically using transition guided reduction
- Title not available (Why is that?)
- Comparative study and proof of single-pass connected components algorithms
- Lower bounds on the OBDD size of two fundamental functions' graphs
- Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
- Larger lower bounds on the OBDD complexity of integer multiplication
- Symbolic coloured SCC decomposition
- I/O- and CPU-optimal recognition of strongly connected components
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
- On finding the strongly connected components in a directed graph
- Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
- A note on the size of OBDDs for the graph of integer multiplication
- Compositional SCC analysis for language emptiness
- On the OBDD representation of some graph classes
- The quest for a tight translation of Büchi to co-Büchi automata
- 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
- A Very Fast Algorithm for Simultaneously Performing Connected-Component Labeling and Euler Number Computing
- An efficient algorithm for computing bisimulation equivalence
- Automata-Theoretic Model Checking Revisited
- On the OBDD size for graphs of bounded tree- and clique-width
- 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
- Finding strongly connected components of simple digraphs based on granulation strategy
- Title not available (Why is that?)
- From complementation to certification
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- A truly symbolic linear-time algorithm for SCC decomposition
- Algorithms and Computation
- Improved distributed algorithms for SCC decomposition
- On the size of (generalized) OBDDs for threshold functions
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
- Symbolic graphs: Linear solutions to connectivity related problems
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471346)
