This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...