Sciweavers

256 search results - page 5 / 52

» Short trees in polygons

16

ISPD
2006
ACM

84views Hardware» more ISPD 2006»

Efficient generation of short and fast repeater tree topologies

14 years 2 months ago

Efficient generation of short and fast repeater tree topologies

Download www.sigda.org

Christoph Bartoschek, Stephan Held, Dieter Rautenb...

claim paper

Read More »

17

ICALP
1997
Springer

58views Programming Languages» more ICALP 1997»

Constructing Big Trees from Short Sequences

14 years 22 days ago

Constructing Big Trees from Short Sequences

Download www.renyi.hu

Péter L. Erdös, Mike A. Steel, L&aacut...

claim paper

Read More »

27

SODA
1994
ACM

81views Algorithms» more SODA 1994»

Spanning Trees Short or Small

13 years 10 months ago

Spanning Trees Short or Small

Download www.ccs.neu.edu

R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel ...

claim paper

Read More »

10

CPC
2002

64views more CPC 2002»

Two Short Proofs Concerning Tree-Decompositions

13 years 8 months ago

Two Short Proofs Concerning Tree-Decompositions

Download www.math.uni-hamburg.de

Patrick Bellenbaum, Reinhard Diestel

claim paper

Read More »

27

COMPGEOM
1993
ACM

122views Discrete Geometry» more COMPGEOM 1993»

A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon

14 years 21 days ago

A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon

Download www.pi6.fernuni-hagen.de

For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...

Rolf Klein, Andrzej Lingas

claim paper

Read More »

« Prev « First page 5 / 52 Last » Next »