2487 search results - page 127 / 498 » Partitions of Graphs into Trees |
147
Voted
ESA
2005
Springer
15 years 9 months ago
2005
Springer
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 ...
126
Voted
WG
2004
Springer
15 years 8 months ago
2004
Springer
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...
152
click to vote
TCAD
2008
15 years 3 months ago
2008
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...
125
Voted
IPL
2010
15 years 1 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...