Sciweavers

5606 search results - page 422 / 1122
» Randomization Techniques for Graphs.
Sort
View
ICSM
1998
IEEE
15 years 11 months ago
Improving Visual Impact Analysis
Visual impact analysis is a software visualisation technique that lets software maintainers judge the impact of proposed changes and plan maintenance accordingly. An existing CASE...
Matthew A. Hutchins, Keith Gallagher
ESEC
1995
Springer
15 years 10 months ago
An Exploratory Study of Program Metrics as Predictors of Reachability Analysis Performance
This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and d...
A. T. Chamillard
ECEASST
2008
60views more  ECEASST 2008»
15 years 6 months ago
Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
Leen Lambers, Hartmut Ehrig, Gabriele Taentzer
EOR
2006
110views more  EOR 2006»
15 years 6 months ago
A constructive algorithm for realizing a distance matrix
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
Sacha C. Varone
KES
2008
Springer
15 years 6 months ago
Visual Analysis Tool for Bipartite Networks
Abstract. To find hidden features of co-authoring relationships, we focused on drawing techniques for bipartite graphs. We previously developed a drawing method called "anchor...
Kazuo Misue