Sciweavers

3396 search results - page 107 / 680
» Tree representations of graphs
Sort
View
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 2 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
WG
2004
Springer
14 years 2 months ago
Planar Graphs, via Well-Orderly Maps and Trees
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
TCAD
2008
195views more  TCAD 2008»
13 years 8 months ago
Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-X...
DM
2006
85views more  DM 2006»
13 years 9 months ago
Further analysis of the number of spanning trees in circulant graphs
Let 1 s1 < s2 <
Talip Atajan, Xuerong Yong, Hiroshi Inaba
ICMCS
2006
IEEE
188views Multimedia» more  ICMCS 2006»
14 years 3 months ago
3D Face Identification Based on Arrangement of Salient Wrinkles
In this paper, we propose an original framework for three dimensional face representation and matching for identification purposes. Basic traits of a face are encoded by extracti...
Gianni Antini, Stefano Berretti, Alberto Del Bimbo...