Symbolic coloured SCC decomposition
From MaRDI portal
Publication:2233494
DOI10.1007/978-3-030-72013-1_4zbMATH Open1474.68210OpenAlexW3137726760MaRDI QIDQ2233494FDOQ2233494
Authors: Nikola Beneš, Samuel Pastva, D. Šafránek, Luboš Brim 
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-72013-1_4
Recommendations
- scientific article; zbMATH DE number 2079387
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- Symbolic graphs: Linear solutions to connectivity related problems
- Algorithms and Computation
- Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Symbolic computation and algebraic computation (68W30) Systems biology, networks (92C42) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- Distributed algorithms for SCC decomposition
- Depth-First Search and Linear Graph Algorithms
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Symbolic model checking: \(10^{20}\) states and beyond
- I/O- and CPU-optimal recognition of strongly connected components
- Title not available (Why is that?)
- A strong-connectivity algorithm and its applications in data flow analysis
- Model checking of biological systems
- Monochromatic components in edge-colored complete uniform hypergraphs
- Depth-first search is inherently sequential
- Model checking the evolution of gene regulatory networks
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- Multicolored trees in complete graphs
- Symbolic graphs: Linear solutions to connectivity related problems
- Title not available (Why is that?)
- Logical analysis of the budding yeast cell cycle
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
- Hamiltonian circuits determining the order of chromosomes
- Complete graphs with no rainbow path
- Title not available (Why is that?)
- Paths and Trails in Edge-Colored Graphs
- AEON: attractor bifurcation analysis of parametrised Boolean networks
- Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
- Detecting attractors in biological models with uncertain parameters
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Computational Methods in Systems Biology
Cited In (8)
- Computing bottom SCCs symbolically using transition guided reduction
- Title not available (Why is that?)
- Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
- From Boolean networks to linear dynamical systems: a simplified route
- Title not available (Why is that?)
- Parametric multi-step scheme for GPU-accelerated graph decomposition into strongly connected components
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- A truly symbolic linear-time algorithm for SCC decomposition
This page was built for publication: Symbolic coloured SCC decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233494)
