Sciweavers

67 search results - page 4 / 14
» Succinct Representations of Arbitrary Graphs
Sort
View
ISPD
1999
ACM
112views Hardware» more  ISPD 1999»
14 years 29 days ago
Arbitrary convex and concave rectilinear block packing using sequence-pair
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
Kunihiro Fujiyoshi, Hiroshi Murata
TVLSI
2002
161views more  TVLSI 2002»
13 years 8 months ago
Arbitrarily shaped rectilinear module placement using the transitive closure graph representation
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang
TALG
2008
127views more  TALG 2008»
13 years 8 months ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
ADHOCNOW
2008
Springer
14 years 3 months ago
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
David Peleg, Liam Roditty
COMPGEOM
2004
ACM
14 years 2 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi