2463 search results - page 204 / 493 » Rankings of Directed Graphs |
134
Voted
ESA
2001
Springer
15 years 8 months ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
142
Voted
COMGEO
2004
ACM
15 years 3 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
139
Voted
TPHOL
2008
IEEE
15 years 10 months ago
2008
IEEE
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
136
Voted
ER
2007
Springer
15 years 9 months ago
2007
Springer
During software requirements analysis and design steps, developers and stakeholders have many alternatives of artifacts such as software component selection and should make decisi...
140
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...