\#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
From MaRDI portal
Publication:2106620
DOI10.1007/978-3-030-51466-2_30OpenAlexW3037440941MaRDI QIDQ2106620
Kévin Perrot, Lucas Venturini, Sylvain Sené
Publication date: 16 December 2022
Full work available at URL: https://arxiv.org/abs/2004.02129
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
- Combinatorics on update digraphs in Boolean networks
- Graph minors. XX: Wagner's conjecture
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs
- Limit cycles and update digraphs in Boolean networks
- On the number of different dynamics in Boolean networks with deterministic update schedules
- Tutte polynomials for directed graphs
- Topology of series-parallel networks
- On the number of update digraphs and its relation with the feedback arc sets and tournaments
- Blocs-H-matrices et convergence des méthodes itératives classiques par blocs
- Hard Enumeration Problems in Geometry and Combinatorics
- Parallel algorithms for series parallel graphs
- A Decomposition for Combinatorial Geometries
- A logical calculus of the ideas immanent in nervous activity
- Synchronism versus asynchronism in monotonic Boolean automata networks
- Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations
This page was built for publication: \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
