202 search results - page 19 / 41 » Large-Girth Roots of Graphs |
133
click to vote
FSTTCS
2001
Springer
15 years 5 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...
100
Voted
ESA
1999
Springer
15 years 5 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
126
click to vote
EMMCVPR
2005
Springer
15 years 6 months ago
2005
Springer
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
108
Voted
RSA
2010
14 years 11 months ago
2010
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
83
Voted
ENTCS
2011
14 years 7 months ago
2011
d abstract) Andr´e Joyal 1 D´epartement des math´ematiques Universit´e du Qu´ebec `a Montr´eal Canada Joachim Kock 2 3 Departament de matem`atiques Universitat Aut`onoma de B...