Sciweavers

250 search results - page 13 / 50
» Constructing a Class of Symmetric Graphs
Sort
View
JCT
2007
140views more  JCT 2007»
13 years 8 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
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
COMBINATORICS
2004
130views more  COMBINATORICS 2004»
13 years 8 months ago
On-line Ramsey Theory
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Ki...
SIAMDM
2008
101views more  SIAMDM 2008»
13 years 8 months ago
On Planar Quasi-Parity Graphs
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
Cláudia Linhares Sales, Frédé...
ICCV
2009
IEEE
2301views Computer Vision» more  ICCV 2009»
15 years 1 months ago
Class Segmentation and Object Localization with Superpixel Neighborhoods
We propose a method to identify and localize object classes in images. Instead of operating at the pixel level, we advocate the use of superpixels as the basic unit of a class s...
Brian Fulkerson, Andrea Vedaldi, Stefano Soatto