431 search results - page 51 / 87 » Bold Graph Drawings |
105
click to vote
ICML
2010
IEEE
15 years 1 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...
120
Voted
ALGORITHMICA
2011
14 years 7 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...
105
click to vote
GD
2006
Springer
15 years 4 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...
92
Voted
ALENEX
2001
15 years 1 months ago
2001
Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilita...
113
Voted
JGAA
2002
15 years 6 days ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...