Sciweavers

672 search results - page 119 / 135
» Lower-stretch spanning trees
Sort
View
IDA
2010
Springer
13 years 9 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
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
PDPTA
2007
13 years 9 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 9 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
CADUI
2004
13 years 9 months ago
Generating Context-Sensitive Multiple Device Interfaces from Design
Abstract This paper shows a technique that allows adaptive user interfaces, spanning multiple devices, to be rendered from the task specification at runtime taking into account the...
Tim Clerckx, Kris Luyten, Karin Coninx