Sciweavers

241 search results - page 23 / 49
» Graphs, Hypergraphs and Hashing
Sort
View
EUROCRYPT
2008
Springer
15 years 3 months ago
Collisions for the LPS Expander Graph Hash Function
Jean-Pierre Tillich, Gilles Zémor
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
15 years 6 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
SAC
2009
ACM
15 years 8 months ago
Origami fold as algebraic graph rewriting
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
Tetsuo Ida, Hidekazu Takahashi
CIE
2006
Springer
15 years 5 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
DAM
2008
67views more  DAM 2008»
15 years 2 months ago
On the variance of Shannon products of graphs
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
József Balogh, Clifford D. Smyth