Results 11 to 20 of about 354 (79)

Failed Zero Forcing Numbers of Trees and Circulant Graphs

open access: yesTheory and Applications of Graphs
Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule (described below) results in all vertices being in $S$.
Luis Gomez   +4 more
doaj   +1 more source

Public Health Risk Evaluation through Mathematical Optimization in the Process of PPPs. [PDF]

open access: yesInt J Environ Res Public Health, 2023
Heydari M, Lai KK, Shi V, Xiao F.
europepmc   +1 more source

Maximum Likelihood Estimation in Mixed Integer Linear Models. [PDF]

open access: yesIEEE Signal Process Lett, 2023
Tucker D, Zhao S, Potter LC.
europepmc   +1 more source

Management of issues relating to marriage, mental illness, and Indian legislation. [PDF]

open access: yesIndian J Psychiatry, 2022
Vaishnav M, Sharma I.
europepmc   +1 more source

Exact feature collisions in neural networks. [PDF]

open access: yesSci Rep
Ozbulak U   +5 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy