431 search results - page 58 / 87 » Bold Graph Drawings |
VISSOFT
2005
IEEE
14 years 4 months ago
2005
IEEE
DependencyViewer helps to control package dependencies to avoid degeneration of package designs. To this end it computes design quality metrics including stabilabstractness for ea...
COMBINATORICA
2008
13 years 11 months ago
2008
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
ENDM
2008
13 years 11 months ago
2008
The nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a > b &g...
VIZSEC
2005
Springer
14 years 4 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
CCCG
2009
13 years 12 months ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...