Results 111 to 120 of about 6,109 (206)
Perfect Matching Under Precedence Constraints
ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
Families of graphs with maximum nullity equal to zero forcing number
The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symmetric real matrices whose ijth entry is nonzero exactly when fi, jg is an edge in G for i =6 j, and the iith entry is any real number.
Alameda Joseph S. +7 more
doaj +1 more source
Unveiling Hidden Features of Strongly Correlated Quantum Systems Through a Complex‐Network Analysis
By applying complex network theory, we report a fundamental and previously unobserved phenomenon in the finite‐size Kitaev model: a singular point at which uniform, nonzero entanglement emerges among all fermion pairs, forming a complete entanglement network.
Guillem Llodrà +2 more
wiley +1 more source
Solving a Random Asymmetric TSP Exactly in Quasi‐Polynomial Time W.H.P.
ABSTRACT Let the costs C(i,j)$$ C\left(i,j\right) $$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent copies of a nonnegative random variable C$$ C $$ from a class of distributions that include the uniform [0,1]$$ \left[0,1\right] $$ distribution and the exponential mean 1 distribution with mean 1.
Tolson Bell, Alan M. Frieze
wiley +1 more source
ABSTRACT Let G$$ G $$ be a Dirac graph, and let S$$ S $$ be a vertex subset of G$$ G $$, chosen uniformly at random. How likely is the induced subgraph G[S]$$ G\left[S\right] $$ to be Hamiltonian? This question, proposed by Erdős and Faudree in 1996, was recently resolved by Draganić, Keevash, and Müyesser, in the setting of graphs.
Zach Hunter +3 more
wiley +1 more source
Addressing ecological challenges from a quantum computing perspective
Abstract With increased access to data and the advent of computers, the use of statistical tools and numerical simulations is becoming commonplace for ecologists. These approaches help improve our understanding of ecological phenomena and their underlying mechanisms in increasingly complex environments.
Maxime Clenet +2 more
wiley +1 more source
ABSTRACT Plant‐hummingbird interaction networks can be influenced by environmental conditions and resources, which vary seasonally and daily. We aimed to understand how variations in these parameters across these two temporal windows influence patterns of plant‐hummingbird interactions and hummingbirds dominance hierarchies in a Brazilian Cerrado ...
Jeane Lima‐Passos +3 more
wiley +1 more source
Adjective‐based qualitative comparative analysis: Relating immobility situations across contexts
Short Abstract This paper introduces an adjective‐based qualitative comparative method for analysing complex lived experiences across diverse contexts. By identifying, harmonising, and relationally comparing salient descriptive adjectives derived from qualitative data, the approach enables structured yet interpretively rich cross‐case comparison ...
Josef Novotný +5 more
wiley +1 more source
On universal‐homogeneous hyperbolic graphs and spaces and their isometry groups
Abstract The Urysohn space is the unique separable metric space that is universal and homogeneous for finite metric spaces, that is, it embeds any finite metric space any isometry between finite subspaces extends to an isometry of the whole space. We here consider the existence of a universal‐homogeneous hyperbolic space. We show that for δ>0$\delta >0$
Katrin Tent
wiley +1 more source

