256 search results - page 9 / 52 » Application-Only Call Graph Construction |
EDBT
2008
ACM
13 years 11 months ago
2008
ACM
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
JGAA
2008
13 years 9 months ago
2008
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
DAM
2008
13 years 10 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
CCCG
2010
13 years 11 months ago
2010
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...