402 search results - page 11 / 81 » On Finding the Number of Graph Automorphisms |
ECCV
2010
Springer
14 years 20 days ago
2010
Springer
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
RSA
2008
13 years 7 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...
COCOON
2003
Springer
14 years 26 days ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
DAM
2010
13 years 7 months ago
2010
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...