Search Sciweavers | Sciweavers

34

ICML
2010
IEEE

186views Machine Learning» more ICML 2010»

Random Spanning Trees and the Prediction of Weighted Graphs

13 years 11 months ago

We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...

Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...

claim paper

Read More »

37

click to vote

ALGORITHMICA
2011

198views Artificial Intelligence» more ALGORITHMICA 2011»

Crossing Number and Weighted Crossing Number of Near-Planar Graphs

13 years 5 months ago

Download www.fmf.uni-lj.si

A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...

Sergio Cabello, Bojan Mohar

claim paper

Read More »

23

click to vote

ALGORITHMICA
2010

115views more ALGORITHMICA 2010»

Multi-Color Pebble Motion on Graphs

13 years 9 months ago

Download www.math.tau.ac.il

We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...

Gilad Goraly, Refael Hassin

claim paper

Read More »

33

click to vote

GD
2006
Springer

125views Computer Graphics» more GD 2006»

Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor

14 years 1 months ago

Download www.univie.ac.at

Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...

David R. Wood, Jan Arne Telle

claim paper

Read More »

19

click to vote

RAS
2008

90views more RAS 2008»

Closed loop motion planning of cooperating mobile robots using graph connectivity

13 years 9 months ago

Download www.cpdee.ufmg.br

Guilherme A. S. Pereira, Vijay Kumar, Mario Fernan...

claim paper