103 search results - page 3 / 21 » Representations of graphs modulo n |
COMBINATORICS
2006
13 years 7 months ago
2006
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We present a novel representation and method for detecting and explaining anomalous activities in a video stream. Drawing from natural language processing, we introduce a represen...
GBRPR
2005
Springer
14 years 1 months ago
2005
Springer
Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more ...
DM
1998
13 years 7 months ago
1998
ALGORITHMICA
2010
13 years 7 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...