686 search results - page 96 / 138 » Packing Cycles in Graphs |
138
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
83
Voted
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
Conventional video summarization methods focus predominantly on summarizing videos along the time axis, such as building a movie trailer. The resulting video trailer tends to reta...
ICNC
2005
Springer
15 years 6 months ago
2005
Springer
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw larg...
103
Voted
DM
2008
15 years 22 days ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
88
Voted
GC
2006
Springer
15 years 19 days ago
2006
Springer
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...