Name
Abstract | ||
|---|---|---|
This paper introduces a structured graph formalism for the visualisation of software designs. Structured graphs have their origins in structured analysis data flow diagrams. The formalism supports the abstraction of large complex networks with browsing and editing operations. These operations are scalable; as a structured graph increase in size the number of user steps to browse and edit remains the same. Both top-down and bottom-up editing are supported. A mathematical treatment af structured graphs is given. The treatment is concerned with network topology rather than geometric layout. It identifies canonical representations and properties. It's general nature makes structural graphs relevant to a range of applications areas. It is hoped that the formalism will assist designers of CASE tools towards enhancing usability. |
Year | Venue | Keywords |
|---|---|---|
1996 | AUSTRALIAN COMPUTER JOURNAL | structured analysis,CASE tools,dataflow diagrams |
DocType | Volume | Issue |
Journal | 28 | 1 |
ISSN | Citations | PageRank |
0004-8917 | 5 | 0.87 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark Sifer | 1 | 72 | 16.32 |
| John Potter | 2 | 289 | 50.46 |