Results 21 to 30 of about 3,644,794 (274)
Dual Protection Routing Trees on Graphs
Mathematics, 2023 In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node
Kung-Jui Pai
doaj +1 more source
Conditions for Implicit-Degree Sum for Spanning Trees with Few Leaves in K1,4-Free Graphs
Mathematics, 2023 A graph with n vertices is called an n-graph. A spanning tree with at most k leaves is referred to as a spanning k-ended tree. Spanning k-ended trees are important in various fields such as network design, graph theory, and communication networks.
Junqing Cai +3 more
doaj +1 more source
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points
Computing in Geometry and Topology, 2022 We present approximation algorithms for the following NP-hard optimization problems related to bottleneck spanning trees in metric spaces. 1- The disjoint bottleneck spanning tree problem: Given n pairs of points in a metric space, find two disjoint ...
Ahmad Biniaz +2 more
doaj +1 more source
Completely Independent Spanning Trees in Line Graphs [PDF]
, 2022 Completely independent spanning trees in a graph $G$ are spanning trees of $G$ such that for any two distinct vertices of $G$, the paths between them in the spanning trees are pairwise edge-disjoint and internally vertex-disjoint.
Hasunuma, Toru
core +1 more source
Two Algorithms for Constructing Independent Spanning Trees in (
IEEE Access, 2020 In a graph $G$ , two spanning trees $T_{1}$ and $T_{2}$ are rooted at the same vertex $r$ . If, for every $v \in V(G)$ , the paths from $v$ to the root $r$ in $T_{1}$ and $T_{2}$ are internally vertex-disjoint, they are called independent ...
Jie-Fu Huang +2 more
doaj +1 more source
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
IEEE Access, 2020 A set of spanning trees in a graph G is called independent spanning trees (ISTs) if they are rooted at the same vertex r, and for each vertex v(≠ r) in G, the two paths from v to r in any two trees share no common vertex expect for v and r.
Jie-Fu Huang +3 more
doaj +1 more source
Progressive Structure from Motion by Iteratively Prioritizing and Refining Match Pairs
Remote Sensing, 2021 Structure from motion (SfM) has been treated as a mature technique to carry out the task of image orientation and 3D reconstruction. However, it is an ongoing challenge to obtain correct reconstruction results from image sets consisting of problematic ...
Teng Xiao +3 more
doaj +1 more source
Independent spanning trees of chordal rings [PDF]
Information Processing Letters, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iwasaki, Yukihiro +3 more
openaire +4 more sources
Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G.
Furuya Michitaka +5 more
doaj +1 more source
The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-Type [PDF]
, 2011 Approaching topics such as connected simple graph, k-partite graph, complete graph, tree, Smarandache (E1,E2)-number of ...
Junliang Cai +3 more
core +1 more source