15 search results - page 2 / 3 » On the number of closed walks in vertex-transitive graphs |
SODA
2008
ACM
13 years 7 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
DKE
2007
13 years 5 months ago
2007
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
ACCV
2010
Springer
13 years 16 days ago
2010
Springer
Abstract. This paper describes a method for topology-free shape morphing based on region cluster-based Earth Mover's Distance (EMD) flows, since existing methods for closed cu...
ESA
2011
Springer
12 years 5 months ago
2011
Springer
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...