Sciweavers

430 search results - page 70 / 86
» Drawing Graphs with GLEE
Sort
View
WSC
2007
13 years 9 months ago
Composability and component-based discrete event simulation
This work presents a framework and a Graphical User Interface, Viskit, for the creation and analysis of component-based Discrete Event Simulation models. Two primary elements of t...
Arnold H. Buss, Curtis L. Blais
ALGORITHMICA
2008
110views more  ALGORITHMICA 2008»
13 years 7 months ago
Bandwidth-Constrained Allocation in Grid Computing
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
Anshul Kothari, Subhash Suri, Yunhong Zhou
COMPGEOM
2006
ACM
14 years 1 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
GD
2007
Springer
14 years 1 months ago
A Bipartite Strengthening of the Crossing Lemma
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
Jacob Fox, János Pach, Csaba D. Tóth
COCOA
2007
Springer
14 years 1 months ago
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
Lanbo Zheng, Christoph Buchheim