Results 31 to 40 of about 48,244 (304)
EL-labelings and canonical spanning trees for subword complexes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We describe edge labelings of the increasing flip graph of a subword complex on a finite Coxeter group, and study applications thereof. On the one hand, we show that they provide canonical spanning trees of the facet-ridge graph of the subword complex ...
Vincent Pilaud, Christian Stump
doaj +1 more source
Lower-Stretch Spanning Trees [PDF]
SIAM Journal on Computing, 2005 We prove that every weighted graph contains a spanning tree subgraph of average stretch O((log n log log n)^2). Moreover, we show how to construct such a tree in time O(m log^2 n).
Elkin, Michael +3 more
openaire +2 more sources
Guarded Second-Order Logic, Spanning Trees, and Network Flows [PDF]
Logical Methods in Computer Science, 2010 According to a theorem of Courcelle monadic second-order logic and guarded second-order logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable $k$-sparse hypergraphs. In the first part of the
Achim Blumensath
doaj +1 more source
Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
Sensors, 2021 For wireless sensor networks (WSN) with connection failure uncertainties, traditional minimum spanning trees are no longer a feasible option for selecting routes.
Jianhua Lyu +3 more
doaj +1 more source
UHD Journal of Science and TechnologyThis paper examines the concepts and practical applications of the spanning tree protocol (STP). It also covers per-VLAN spanning tree (PVST), multiple spanning tree (MST), and rapid STP (RSTP). Moreover, practical scenarios are presented to help the reader understand the concepts and implementations of these protocols.
Dana Faiq Abd +3 more
openaire +2 more sources
Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing
FEBS Letters, EarlyView.Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley +1 more source
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks
IEEE Access, 2021 A set of the spanning trees in a graph $G$ is called independent spanning trees if they have a common root $r$ and for each vertex $v\in V(G)\setminus \{r\}$ , the paths from $v$ to $r$ in any two trees are directed edge-disjoint and internally ...
Yi-Cheng Yang +5 more
doaj +1 more source
FEBS Letters, EarlyView.Cryptochrome and PAS/LOV proteins play intricate roles in circadian clocks where they act as both sensors and mediators of protein–protein interactions. Their ubiquitous presence in signaling networks has positioned them as targets for small‐molecule therapeutics. This review provides a structural introduction to these protein families.
Eric D. Brinckman +2 more
wiley +1 more source
Spanning 3-Ended Trees in Almost Claw-Free Graphs
Discrete Dynamics in Nature and Society, 2015 We prove that if G is a k-connected (k≥2) almost claw-free graph of order n and σk+3(G)≥n+2k-2, then G contains a spanning 3-ended tree, where σk(G)=min{∑v∈Sdeg(v):S is an independent set of G with S=k}.
Xiaodong Chen, Meijin Xu, Yanjun Liu
doaj +1 more source
Spanning Trees—Short or Small [PDF]
SIAM Journal on Discrete Mathematics, 1996 We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is the $k$MST problem in which we require a tree of minimum weight spanning at least $k$ nodes in an edge-weighted ...
Ravi, R. +4 more
openaire +2 more sources