1736 search results - page 132 / 348 » The rank-width of Directed Graphs |
146
click to vote
COMGEO
2004
ACM
15 years 4 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...
148
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
146
click to vote
TPHOL
2008
IEEE
15 years 11 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...
147
click to vote
ER
2007
Springer
15 years 10 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...
144
click to vote
ISAAC
2005
Springer
15 years 10 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...