Sciweavers

1605 search results - page 12 / 321
» On Partitional Labelings of Graphs
Sort
View
STACS
2007
Springer
14 years 2 months ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg
JCT
2008
65views more  JCT 2008»
13 years 8 months ago
Random graphs on surfaces
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
Colin McDiarmid
ICML
2006
IEEE
14 years 9 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
SSD
2007
Springer
107views Database» more  SSD 2007»
14 years 2 months ago
Spatial Partition Graphs: A Graph Theoretic Model of Maps
The notion of a map is a fundamental metaphor in spatial disciplines. However, there currently exist no adequate data models for maps that define a precise spatial data type for m...
Mark McKenney, Markus Schneider
COMBINATORICA
2010
13 years 3 months ago
Every rayless graph has an unfriendly partition
We prove that every rayless graph has an unfriendly partition.
Henning Bruhn, Reinhard Diestel, Agelos Georgakopo...