Sciweavers

384 search results - page 56 / 77
» On s-hamiltonian-connected line graphs
Sort
View
GD
1997
Springer
14 years 23 days ago
Area Requirements for Drawing Hierarchically Planar Graphs
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
Xuemin Lin, Peter Eades
CGF
2010
169views more  CGF 2010»
13 years 8 months ago
Image-Based Edge Bundles: Simplified Visualization of Large Graphs
We present a new approach aimed at understanding the structure of connections in edge-bundling layouts. We combine the advantages of edge bundles with a bundle-centric simplified ...
Alexandru Telea, Ozan Ersoy
ENTCS
2008
108views more  ENTCS 2008»
13 years 8 months ago
Modelling Dynamic Software Architectures using Typed Graph Grammars
Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of th...
Roberto Bruni, Antonio Bucchiarone, Stefania Gnesi...
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
14 years 8 days ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...
OOPSLA
2000
Springer
14 years 6 days ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg