532 search results - page 16 / 107 » Graphically abelian groups |
IJAC
2008
13 years 9 months ago
2008
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
ASIACRYPT
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. A t out of n threshold scheme is such that shares are distributed to n participants so that any set of t participants can compute the secret, whereas any set of less than...
DCC
2006
IEEE
14 years 9 months ago
2006
IEEE
COMBINATORICA
2008
13 years 10 months ago
2008
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
DM
2010
13 years 10 months ago
2010
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...