5606 search results - page 288 / 1122 » Randomization Techniques for Graphs. |
169
click to vote
MICS
2008
15 years 6 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
170
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
nd maps are powerful abstractions. Their combination, Hierarchical Graph Maps, provide effective tools to process a graph that is too large to fit on the screen. They provide hier...
176
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
176
click to vote
SIAMDM
2010
15 years 4 months ago
2010
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...
187
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Regression analysis is a powerful tool for the study of changes in a dependent variable as a function of an independent regressor variable, and in particular it is applicable to t...