Sciweavers

4913 search results - page 105 / 983
» Results and Perspectives of the G
Sort
View
JCT
2008
70views more  JCT 2008»
13 years 10 months ago
Connectivity keeping edges in graphs with large minimum degree
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G - v is still k-connec...
Shinya Fujita, Ken-ichi Kawarabayashi
MM
2010
ACM
151views Multimedia» more  MM 2010»
13 years 10 months ago
Explicit and implicit concept-based video retrieval with bipartite graph propagation model
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...
Lei Bao, Juan Cao, Yongdong Zhang, Jintao Li, Ming...
JCT
2007
140views more  JCT 2007»
13 years 10 months ago
Homomorphisms and edge-colourings of planar graphs
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
Reza Naserasr
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
14 years 1 months ago
Variable Length Genomes for Evolutionary Algorithms
A general variable length genome, called exG, is developed here to address the problems of fixed length representations in canonical evolutionary algorithms. Convergence aspects o...
C.-Y. Lee, E. K. Antonsson
COMBINATORICA
2008
88views more  COMBINATORICA 2008»
13 years 10 months ago
Geometric graphs with no two parallel edges
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...
Rom Pinchasi