721 search results - page 9 / 145 » Graphs with Large Obstacle Numbers |
DM
2000
13 years 9 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
COMBINATORICS
2006
13 years 9 months ago
2006
We prove the following extension of an old result of Andr
SIAMDM
2008
13 years 9 months ago
2008
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Cr...