Sciweavers

1545 search results - page 177 / 309
» On tree congestion of graphs
Sort
View
IV
2005
IEEE
81views Visualization» more  IV 2005»
15 years 3 months ago
A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
Chun-Cheng Lin, Hsu-Chun Yen
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
14 years 9 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
AINA
2003
IEEE
15 years 3 months ago
Detection of Multiple Bottleneck Bandwidth
This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC’s TTM project to perfor...
Niwat Thepvilojanapong, Yoshito Tobe, Kaoru Sezaki
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
15 years 12 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
SAC
2006
ACM
15 years 4 months ago
MTree: an XML XPath graph index
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
P. Mark Pettovello, Farshad Fotouhi