scientific article; zbMATH DE number 7566051

MaRDI QIDQ5094123

David Šafránek, Luboš Brim, Nikola Beneš, Samuel Pastva

Publication date: 2 August 2022

Full work available at URL: https://arxiv.org/abs/2108.13113

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

saturationsymbolic algorithmsystems biologystrongly connected componentsedge-coloured digraphs

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items

Phenotype control of partially specified Boolean networks

Uses Software

• Ginsim
• Aeon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Depth-first search is inherently sequential
• A strong-connectivity algorithm and its applications in data flow analysis
• I/O- and CPU-optimal recognition of strongly connected components
• Hamiltonian circuits determining the order of chromosomes
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Logical analysis of the budding yeast cell cycle
• AEON: attractor bifurcation analysis of parametrised Boolean networks
• Symbolic coloured SCC decomposition
• Symbolic graphs: Linear solutions to connectivity related problems
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• Monochromatic components in edge-colored complete uniform hypergraphs
• Distributed Algorithms for SCC Decomposition
• Complete graphs with no rainbow path
• Graph-Based Algorithms for Boolean Function Manipulation
• Model Checking of Biological Systems
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Depth-First Search and Linear Graph Algorithms
• Computational Methods in Systems Biology
• Multicolored trees in complete graphs