620 search results - page 29 / 124 » The edge-flipping group of a graph |
ICCV
1999
IEEE
14 years 10 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
CIAC
2006
Springer
14 years 16 days ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
IJAC
2008
13 years 8 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
SIAMCOMP
2008
13 years 8 months ago
2008
Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by st...
IJNSEC
2008
13 years 8 months ago
2008
In group communication, users often have different access rights to multiple data streams. Based on the access relation of users and data streams, users can form partially ordered...