Sciweavers

3267 search results - page 22 / 654
» Generalized quasirandom graphs
Sort
View
DM
2008
95views more  DM 2008»
13 years 7 months ago
General neighbour-distinguishing index of a graph
It is proved that edges of a graph G with no component K2 can be coloured using at most 2 log2 (G) + 1 colours so that any two adjacent vertices have distinct sets of colours of t...
Ervin Györi, Mirko Hornák, Cory Palmer...
EOR
2010
82views more  EOR 2010»
13 years 7 months ago
Satisfactory graph partition, variants, and generalizations
The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbor...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
EMMCVPR
2003
Springer
14 years 18 days ago
Generalized Multi-camera Scene Reconstruction Using Graph Cuts
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...
Vladimir Kolmogorov, Ramin Zabih, Steven J. Gortle...
IJRR
2000
113views more  IJRR 2000»
13 years 7 months ago
Sensor-Based Exploration: The Hierarchical Generalized Voronoi Graph
The hierarchical generalized Voronoi graph (HGVG) is a new roadmap developed for sensor-based exploration in unknown environments. This paper defines the HGVG structure: a robot c...
Howie Choset, Joel W. Burdick
ECML
2007
Springer
14 years 1 months ago
Graph-Based Domain Mapping for Transfer Learning in General Games
A general game player is an agent capable of taking as input a description of a game’s rules in a formal language and proceeding to play without any subsequent human input. To do...
Gregory Kuhlmann, Peter Stone