Results 151 to 160 of about 2,238,100 (388)
Negative association in uniform forests and connected graphs
, 2003 We consider three probability measures on subsets of edges of a given finite graph $G$, namely those which govern, respectively, a uniform forest, a uniform spanning tree, and a uniform connected subgraph. A conjecture concerning the negative association
Grimmett, G. R., Winkler, S. N.
core +6 more sources
On the SPANNING k-TREE problem
Discrete Applied Mathematics, 1993 A \(k\)-tree \(T\) is defined recursively as being either a clique of size \(k\) or having a vertex \(x\) whose neighbourhood is a clique of size \(k\) and such that \(T-x\) is a \(k\)-tree. (Note that \(k\)-trees are not trees, if \(k>1\).) The following SPANNING \(k\)-TREE problem is known to be NP-complete: given a graph \(G\), does \(G\) possess a ...
Leizhen Cai, Frédéric Maffray
openaire +3 more sources
Peptide Sequencing With Single Acid Resolution Using a Sub‐Nanometer Diameter Pore
Advanced Functional Materials, EarlyView.To sequence a single molecule of Aβ1−42–sodium dodecyl sulfate (SDS), the aggregate is forced through a sub‐nanopore 0.4 nm in diameter spanning a 4.0 nm thick membrane. The figure is a visual molecular dynamics (VMD) snapshot depicting the translocation of Aβ1−42–SDS through the pore; only the peptide, the SDS, the Na+ (yellow/green) and Cl− (cyan ...
Apurba Paul +8 more
wiley +1 more source
Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants. [PDF]
Data Brief, 2023 Carvalho IA, Coco AA.
europepmc +1 more source
A Note on Finding the Shortest Spanning Tree Of an Incomplete Connected Graph By Manual Methods [PDF]
, 1975 Trevor R. Fietz
openalex +1 more source
An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size [PDF]
, 2001 Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster.
Kern, W., Pop, P.C., Still, G.J.
core +1 more source
Spanning Trees in Regular Graphs
European Journal of Combinatorics, 1983 Let X be a regular graph with degree k ≥ 3 and order n. Then the number of spanning trees of X is κ(X)
openaire +2 more sources
Novel Bioconjugate Materials: Synthesis, Characterization and Medical Applications
Advanced Healthcare Materials, EarlyView.This review discusses the bioconjugation of novel materials grouped under “biological”, “hybrid” and “synthetic” categories. Medical applications ranging from cancer therapy and diagnostics to optogenetics and tissue engineering are explored, and conjugation trends are highlighted as a general guide. The review concludes with a comparison of techniques
Ellie Martin +6 more
wiley +1 more source
Computing minimum spanning trees efficiently [PDF]
, 1972 A. Kershenbaum, R. Van Slyke
openalex +1 more source
Advanced Healthcare Materials, EarlyView.This study reveals how vorticity—a swirling flow pattern—enhances platelet aggregation and thrombus formation in high‐shear conditions. Using a custom microfluidic model, it is shows that vorticity promotes vWF–GPIbα interactions and calcium signaling, providing new insights into thrombosis mechanobiology and informing safer blood‐contacting medical ...
Jianfang Ren +13 more
wiley +1 more source