725 search results - page 59 / 145 » Graph Drawing in Motion |
120
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
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...
137
Voted
ALGORITHMICA
2011
14 years 9 months ago
2011
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...
115
Voted
ALGORITHMICA
2010
15 years 2 months ago
2010
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...
132
Voted
GD
2006
Springer
15 years 6 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
68
Voted
RAS
2008
15 years 2 months ago
2008