Sciweavers

Share
30 search results - page 3 / 6
» gc 2008
Sort
View
GC
2010
Springer
8 years 10 months ago
20 Years of Negami's Planar Cover Conjecture
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
Petr Hlinený
GC
2008
Springer
9 years 5 days ago
Almost Given Length Cycles in Digraphs
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
Raphael Yuster
GC
2008
Springer
9 years 5 days ago
Domination in Graphs of Minimum Degree at least Two and Large Girth
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
Christian Löwenstein, Dieter Rautenbach
DM
2008
112views more  DM 2008»
9 years 6 days ago
Coloring the Cartesian sum of graphs
For graphs G and H, let G H denote their Cartesian sum. This paper investigates the chromatic number and the circular chromatic number for GH. It is proved that (G H) max{ c(G)...
Daphne Der-Fen Liu, Xuding Zhu
CVPR
2008
IEEE
1042views Computer Vision» more  CVPR 2008»
10 years 2 months ago
Graph cut based image segmentation with connectivity priors
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother
books