Sciweavers

399 search results - page 74 / 80
» The sandwich line graph
Sort
View
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 9 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
CLA
2004
13 years 9 months ago
Planarity of Additively Drawn Concept Lattices
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
Christian Zschalig
ITSSA
2006
97views more  ITSSA 2006»
13 years 7 months ago
Service Evolution in Bio-Inspired Communication Systems
: An autonomic network must work unsupervised, therefore must be able to respond to unpredictable situations. The BIONETS project is working towards resilient network services that...
Daniele Miorandi, Lidia Yamamoto, Paolo Dini
TCS
2002
13 years 7 months ago
Some permutation routing algorithms for low-dimensional hypercubes
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
Frank K. Hwang, Y. C. Yao, Bhaskar DasGupta
ISVC
2010
Springer
13 years 6 months ago
Subversion Statistics Sifter
We present Subversion Statistics Sifter, a visualisation and statistics system for exploring the structure and evolution of data contained in Subversion repositories with respect t...
Christoph Müller, Guido Reina, Michael Burch,...