328 search results - page 37 / 66 » Algorithms for the edge-width of an embedded graph |
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
GD
2008
Springer
15 years 26 days ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
149
click to vote
SCAM
2005
IEEE
15 years 5 months ago
2005
IEEE
Most software for embedded systems, including digital signal processing systems, is coded in assembly language. For both understanding the software and for reverse compiling it to...
101
click to vote
STOC
2003
ACM
16 years 2 days ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
WSDM
2010
ACM
15 years 9 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...