Sciweavers

2283 search results - page 118 / 457
» Bounds of Graph Characteristics
Sort
View
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
13 years 9 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman
IPL
2007
101views more  IPL 2007»
13 years 8 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
RSA
2010
104views more  RSA 2010»
13 years 6 months ago
Random graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Geoffrey R. Grimmett, Svante Janson
ECAI
2008
Springer
13 years 9 months ago
Sequential spatial reasoning in images based on pre-attention mechanisms and fuzzy attribute graphs
Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics, and graphs...
Geoffroy Fouquier, Jamal Atif, Isabelle Bloch
GD
2007
Springer
14 years 2 months ago
Minimizing the Area for Planar Straight-Line Grid Drawings
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
Marcus Krug, Dorothea Wagner