Sciweavers

431 search results - page 31 / 87

» Bold Graph Drawings

93

SIAMCOMP
2002

73views more SIAMCOMP 2002»

Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas

15 years 21 days ago

Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas

Download www.cis.upenn.edu

Guy Even, Sudipto Guha, Baruch Schieber

claim paper

Read More »

77

Voted

GC
2010
Springer

117views Applied Computing» more GC 2010»

Drawing Disconnected Graphs on the Klein Bottle

14 years 11 months ago

Drawing Disconnected Graphs on the Klein Bottle

Download www-fourier.ujf-grenoble.fr

Laurent Beaudou, Antoine Gerbaud, Roland Grappe, F...

claim paper

Read More »

71

IPL
2010

80views more IPL 2010»

A note on isosceles planar graph drawing

14 years 11 months ago

A note on isosceles planar graph drawing

Download web.dia.uniroma3.it

Fabrizio Frati

claim paper

Read More »

84

TCS
2010

130views Theoretical Computer Science» more TCS 2010»

A graph theoretic approach to general Euler diagram drawing

14 years 11 months ago

A graph theoretic approach to general Euler diagram drawing

Download www.cs.kent.ac.uk

Gem Stapleton, John Howse, Peter J. Rodgers

claim paper

Read More »

122

Voted

JCT
2007

103views more JCT 2007»

Geometric drawings of Kn with few crossings

15 years 28 days ago

Geometric drawings of Kn with few crossings

Download www.csun.edu

We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...

Bernardo M. Ábrego, Silvia Fernández...

claim paper

Read More »

« Prev « First page 31 / 87 Last » Next »