5100 search results - page 104 / 1020 » The Linear Complexity of a Graph |
CISC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
COMBINATORICS
1999
13 years 8 months ago
1999
Abstract. Ehrenborg and Steingr
WG
2009
Springer
14 years 3 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...