3105 search results - page 92 / 621 » The Path-Packing Structure of Graphs |
163
click to vote
SIGMETRICS
2012
ACM
13 years 5 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
111
Voted
SODA
1996
ACM
15 years 4 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
111
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
The extended abstract describes a method for recognizing similar sub-parts of objects described by 3D polygonal meshes. The innovation of this method is the coupling of structure a...
127
click to vote
SIAMDM
2011
14 years 10 months ago
2011
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median ...
221
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...