Sciweavers

3396 search results - page 177 / 680
» Tree representations of graphs
Sort
View
CPC
2002
80views more  CPC 2002»
13 years 9 months ago
The Wiener Index Of Random Trees
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...
Ralph Neininger
JCO
2010
67views more  JCO 2010»
13 years 7 months ago
Galaxy cutsets in graphs
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...
Nicolas Sonnerat, Adrian Vetta
VL
1999
IEEE
142views Visual Languages» more  VL 1999»
14 years 1 months ago
Visual Graphs
The formal treatment of visual languages is often based on graph representations. Since the matter of discourse is visual languages, it would be convenient if the formal manipulat...
Martin Erwig
CORR
2002
Springer
115views Education» more  CORR 2002»
13 years 9 months ago
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...
Cesim Erten, Stephen G. Kobourov
JSYML
2008
100views more  JSYML 2008»
13 years 9 months ago
Measurable chromatic numbers
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...
Benjamin D. Miller