Sciweavers

620 search results - page 13 / 124
» The edge-flipping group of a graph
Sort
View
ASIACRYPT
2008
Springer
15 years 1 months ago
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tart...
EJC
2007
14 years 11 months ago
A new family of locally 5-arc transitive graphs
We present a new family of locally 5–arc transitive graphs. The graphs constructed are bipartite with valency {2m + 1, 2m}. The actions of the automorphism group on the two bipa...
Michael Giudici, Cai Heng Li, Cheryl E. Praeger
STACS
2007
Springer
15 years 5 months ago
Hard Metrics from Cayley Graphs of Abelian Groups
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
Ilan Newman, Yuri Rabinovich
ARSCOM
2008
68views more  ARSCOM 2008»
14 years 12 months ago
Group connectivity of certain graphs
Jingjing Chen, Elaine M. Eschen, Hong-Jian Lai