Sciweavers

384 search results - page 67 / 77
» On s-hamiltonian-connected line graphs
Sort
View
TAP
2008
Springer
102views Hardware» more  TAP 2008»
13 years 8 months ago
Visualizing graphs in three dimensions
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
Colin Ware, Peter Mitchell
CLA
2007
13 years 10 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
OOPSLA
1999
Springer
14 years 25 days ago
Compositional Pointer and Escape Analysis for Java Programs
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...
John Whaley, Martin C. Rinard
ICSE
1995
IEEE-ACM
14 years 4 days ago
A Framework for Selective Recompilation in the Presence of Complex Intermodule Dependencies
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...
Craig Chambers, Jeffrey Dean, David Grove
CONCUR
2008
Springer
13 years 10 months ago
Unfolding-Based Diagnosis of Systems with an Evolving Topology
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...
Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara...