Cover Image

Strong modules and asynchronous attractors of Boolean networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Ruet, Paul
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the number of asynchronous attractors in AND-NOT Boolean networks
by: Trinh, Van-Giang, et al.
Published: (2025)

Asynchronous dynamics of isomorphic Boolean networks
by: Bridoux, Florian, et al.
Published: (2024)

Boolean Functions with Small Approximate Spectral Norm
by: Cheung, Tsun-Ming, et al.
Published: (2024)

Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
by: Schwieger, Robert, et al.
Published: (2023)

The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces
by: Ihringer, Ferdinand
Published: (2023)

A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
by: Ihringer, Ferdinand
Published: (2024)

Attractor identification in asynchronous Boolean dynamics with network reduction
by: Tonello, Elisa, et al.
Published: (2023)

Generalising the maximum independent set algorithm via Boolean networks
by: Gadouleau, Maximilien, et al.
Published: (2024)

Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)

Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
by: Anand, Bijo S., et al.
Published: (2025)

On the number of non-degenerate canalizing Boolean functions
by: Kadelka, Claus
Published: (2025)

On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces
by: Weiß, Meike, et al.
Published: (2025)

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)

String attractors and bi-infinite words
by: Béaur, Pierre, et al.
Published: (2024)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)

VC-Dimension vs Degree: An Uncertainty Principle for Boolean Functions
by: Chang, Fan, et al.
Published: (2025)

Interaction graphs of isomorphic automata networks II: universal dynamics
by: Bridoux, Florian, et al.
Published: (2024)

The $g$-good-neighbor diagnosability of product networks under the PMC model
by: Wang, Zhao, et al.
Published: (2025)

The 1/3-conjectures for domination in cubic graphs
by: Dorbec, Paul, et al.
Published: (2024)

Obstruction characterization of co-TT graphs
by: Das, Ashok Kumar, et al.
Published: (2023)

On powers of circular arc graphs
by: Das, Ashok Kumar, et al.
Published: (2022)

Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)

Cops and Robber -- When Capturing is not Surrounding
by: Jungeblut, Paul, et al.
Published: (2023)

Vertex-edge domination on subclasses of bipartite graphs
by: Pandey, Arti, et al.
Published: (2025)

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
by: Foucaud, Florent, et al.
Published: (2025)

Stability of Linear Boolean Networks
by: Chandrasekhar, Karthik, et al.
Published: (2022)

Plane Strong Connectivity Augmentation
by: Bessy, Stéphane, et al.
Published: (2025)

Cube Height, Cube Width and Related Extremal Problems for Posets
by: Bastide, Paul, et al.
Published: (2025)

Primal-Dual Cops and Robber
by: Ha, Minh Tuan, et al.
Published: (2023)

On the Identity and Group Problems for Complex Heisenberg Matrices
by: Bell, Paul C., et al.
Published: (2023)

On the existence of $δ$-temporal cliques in random simple temporal graphs
by: Mertzios, George B., et al.
Published: (2024)

Making Graphs Irregular through Irregularising Walks
by: Bensmail, Julien, et al.
Published: (2025)

A lower bound on the spectrum of unimodular networks
by: Rahman, Mustazee
Published: (2016)

Hardness of Finding Kings and Strong Kings
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)

The Strong Birthday Problem Revisited
by: Tripathy, Chijul B.
Published: (2025)

A Boolean encoding of the Most Permissive semantics for Boolean networks
by: de Chancel, Laure, et al.
Published: (2026)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)