Results 191 to 200 of about 8,902 (235)

The Ground-Set-Cost Budgeted Maximum Coverage Problem. [PDF]

Theory Comput Syst
van Heuven van Staereling I, de Keijzer B, Schäfer G.   +2 more
europepmc   +1 more source

Comparative Systematic Analysis of Gray Matter Biophysical Models on a Public Dataset

Magnetic Resonance in Medicine, EarlyView.
ABSTRACT Purpose Biophysical models of diffusion tailored to characterize gray matter (GM) microstructure are gaining traction in the neuroimaging community. NEXI, SMEX, SANDI, and SANDIX represent recent efforts to account for different microstructural features, such as soma contributions and inter‐compartment exchange, in the diffusion MRI (dMRI ...
Santiago Mezzano, Quentin Uhl, Tommaso Pavan, Jasmine Nguyen‐Duc, Hansol Lee, Susie Huang, Ileana Jelescu   +6 more
wiley   +1 more source

Network design for bypass roads using interval valued fuzzy outerplanar graphs. [PDF]

Sci Rep
Jaisankar D, Ramalingam S, Deivanayagampillai N, Walelign T.   +3 more
europepmc   +1 more source

Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction

Networks, EarlyView.
ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Ulrich Pferschy   +6 more
wiley   +1 more source

Parameterized Complexities of Dominating and Independent Set Reconfiguration. [PDF]

Algorithmica
Bodlaender HL, Groenland C, Swennenhuis CMF.   +2 more
europepmc   +1 more source

Investigating Mixed‐Integer Programming Approaches for the p$$ p $$‐α$$ \alpha $$‐Closest‐Center Problem

Networks, EarlyView.
ABSTRACT In this work, we introduce and study the p$$ p $$‐α$$ \alpha $$‐closest‐center problem (pα$$ p\alpha $$CCP), which is a generalization of the p$$ p $$‐second‐center problem, a recently emerged variant of the classical (discrete) p‐center problem.
Elisabeth Gaar, Sara Joosten, Markus Sinnl   +2 more
wiley   +1 more source

Integrating Pythagorean fuzzy numbers into the graph model to resolve water resource conflicts in the Yellow River Basin. [PDF]

Sci Rep
Cao Y.
europepmc   +1 more source

Interdiction Models and Heuristics for Graph Propagation

Networks, EarlyView.
ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley   +1 more source

Distance degrees of vertex-transitive graphs(Graph Theory and Its Applications)

Distance degrees of vertex-transitive graphs(Graph Theory and Its Applications)
openaire  

Decoupling between activation time and steady-state level in input-output responses. [PDF]

PLoS Comput Biol
Ravanelli G, Nam KM, Gunawardena J, Martinez-Corral R.   +3 more
europepmc   +1 more source