2487 search results - page 193 / 498 » Partitions of Graphs into Trees |
165
click to vote
FSTTCS
2001
Springer
15 years 8 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
127
click to vote
CPC
2002
15 years 3 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
123
click to vote
APN
2005
Springer
15 years 9 months ago
2005
Springer
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
119
click to vote
JGAA
2007
15 years 3 months ago
2007
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
113
click to vote
JCO
2010
15 years 2 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...