Sciweavers

266 search results - page 21 / 54
» Graphs with Bounded Induced Distance
Sort
View
ICCD
2006
IEEE
137views Hardware» more  ICCD 2006»
16 years 1 months ago
Reduction of Crosstalk Pessimism using Tendency Graph Approach
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...
Murthy Palla, Klaus Koch, Jens Bargfrede, Manfred ...
FOCS
2002
IEEE
15 years 10 months ago
Learning a Hidden Matching
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...
127
Voted
COCOON
2006
Springer
15 years 8 months ago
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
Min Chih Lin, Jayme Luiz Szwarcfiter
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
15 years 9 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid
131
Voted
ISVD
2007
IEEE
15 years 11 months ago
Voronoi Diagrams for Oriented Spheres
We consider finite sets of oriented spheres in Rk−1 and, by interpreting such spheres as points in Rk , study the Voronoi diagrams they induce for several variants of distance ...
Franz Aurenhammer, Johannes Wallner, Martin Petern...