1127 search results - page 100 / 226 » Testing the Expansion of a Graph |
ASPDAC
2004
ACM
15 years 3 months ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
FUZZY
2001
Springer
15 years 2 months ago
2001
Springer
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
FUIN
2006
14 years 10 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
JGAA
2008
14 years 10 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
APVIS
2011
13 years 10 months ago
2011
We present the results of a study comparing five directed-edge representations for use in 2D, screen-based node-link diagrams. The goal of this work is to extend the understandin...