Reconfiguring Shortest Paths in Graphs. [PDF]
AlgorithmicaGajjar K, Jha AV, Kumar M, Lahiri A.
europepmc +1 more source
GDSCalc: A Web-Based Application for Evaluating Discrete Graph Dynamical Systems. [PDF]
PLoS One, 2015 Elmeligy Abdelhamid SH +4 more
europepmc +1 more source
Embedding of complete and nearly complete binary trees into hypercubes
, 2015 A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are ...
Vesel, Aleksander
core
Mapping the attractor landscape of Boolean networks with biobalm. [PDF]
BioinformaticsTrinh VG, Park KH, Pastva S, Rozum JC.
europepmc +1 more source
Reproducible Boolean model analyses and simulations with the CoLoMoTo software suite: a tutorial. [PDF]
Interface FocusNoël V +4 more
europepmc +1 more source
Embedding of complete and nearly complete binary trees into hypercubes
, 2012 A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are ...
Vesel, Aleksander
core
An open problem: Why are motif-avoidant attractors so rare in asynchronous Boolean networks? [PDF]
J Math BiolPastva S +4 more
europepmc +1 more source
The generalization complexity measure for continuous input data. [PDF]
ScientificWorldJournal, 2014 Gómez I +4 more
europepmc +1 more source
On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization
, 2008 Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in Pseudo-Boolean Optimization (PBO) algorithms derived from the DPLL procedure for ...
Heras, Federico +5 more
core
Quantum Talagrand, KKL and Friedgut's Theorems and the Learnability of Quantum Boolean Functions. [PDF]
Commun Math PhysRouzé C, Wirth M, Zhang H.
europepmc +1 more source