Results 41 to 50 of about 212,144 (329)
Chain-Constrained Spanning Trees [PDF]
Mathematical Programming, 2013 We consider the problem of finding a spanning tree satisfying a family of additional constraints. Several settings have been considered previously, the most famous being the problem of finding a spanning tree with degree constraints. Since the problem is hard, the goal is typically to find a spanning tree that violates the constraints as little as ...
Olver, Neil, Zenklusen, Rico
openaire +6 more sources
Spanning k-ended trees of 3-regular connected graphs
Electronic Journal of Graph Theory and Applications, 2017 A vertex of degree one is called an end-vertex and the set of end-vertices of G is denoted by End(G). For a positive integer k, a tree T be called k-ended tree if $|End(T)| \leq k$. In this paper, we obtain sufficient conditions for spanning k-trees of 3-
Hamed Ghasemian Zoeram, Daniel Yaqubi
doaj +1 more source
Enumeration of spanning trees in a pseudofractal scale-free web
, 2010 Spanning trees are an important quantity characterizing the reliability of a network, however, explicitly determining the number of spanning trees in networks is a theoretical challenge.
Liu, Hongxiao +3 more
core +1 more source
Non-crossing trees revisited: cutting down and spanning subtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random cuts to destroy a size-$n$ non-crossing tree and $\textit{(ii)}$ the spanning subtree-size of $p$ randomly chosen nodes in a size-$n$ non-crossing tree ...
Alois Panholzer
doaj +1 more source
Spanning Trees in Random Satisfiability Problems
, 2006 Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning trees in the ...
A Ramezanpour +6 more
core +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
Number of Spanning Trees of Cartesian and Composition Products of Graphs and Chebyshev Polynomials
IEEE Access, 2019 Enumerating all the spanning trees of a graph without duplication is one of the widely studied problems in electrical engineering and computer science literature.
S. N. Daoud
doaj +1 more source
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
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees [PDF]
, 2014 A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges.
Narayanaswamy, N. S., Ramakrishna, G.
core +1 more source
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