Symbolic coloured SCC decomposition

DOI10.1007/978-3-030-72013-1_4MaRDI QIDQ2233494zbMATH OpenOpenAlexFDO

Authors Nikola Beneš, Samuel Pastva, D. Šafránek, Luboš Brim

Publication date 18 October 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-72013-1_4

zbMATH Keywords

systems biologysymbolic algorithmstrongly connected componentsedge-coloured digraphs

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 1067836 (Why is no real title available?)
• scientific article; zbMATH DE number 2079387 (Why is no real title available?)
• A strong-connectivity algorithm and its applications in data flow analysis
• AEON: attractor bifurcation analysis of parametrised Boolean networks
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• Complete graphs with no rainbow path
• Computational Methods in Systems Biology
• Depth-First Search and Linear Graph Algorithms
• Depth-first search is inherently sequential
• Detecting attractors in biological models with uncertain parameters
• Distributed algorithms for SCC decomposition
• Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Graph-Based Algorithms for Boolean Function Manipulation
• Hamiltonian circuits determining the order of chromosomes
• I/O- and CPU-optimal recognition of strongly connected components
• Logical analysis of the budding yeast cell cycle
• Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
• Model checking of biological systems
• Model checking the evolution of gene regulatory networks
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Monochromatic components in edge-colored complete uniform hypergraphs
• Multicolored trees in complete graphs
• Paths and Trails in Edge-Colored Graphs
• Symbolic graphs: Linear solutions to connectivity related problems
• Symbolic model checking: \(10^{20}\) states and beyond

Cited in

(8)

• Computing bottom SCCs symbolically using transition guided reduction
• scientific article; zbMATH DE number 7566051 (Why is no real title available?)
• Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter
• From Boolean networks to linear dynamical systems: a simplified route
• scientific article; zbMATH DE number 2079387 (Why is no real title available?)
• 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)