1952 search results - page 6 / 391 » Complete partitions of graphs |
130
Voted
CIVR
2005
Springer
15 years 9 months ago
2005
Springer
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...
117
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
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...
124
Voted
GC
2006
Springer
15 years 3 months ago
2006
Springer
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...
HICSS
1997
IEEE
15 years 7 months ago
1997
IEEE
142
click to vote
JGT
2007
15 years 3 months ago
2007
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...