| 书目名称 | The Design of an Extendible Graph Editor |
| 编辑 | Frances Newbery Paulisch |
| 视频video | |
| 丛书名称 | Lecture Notes in Computer Science |
| 图书封面 |  |
| 描述 | Graphs can be used to convey information about relationshipsin manyapplications. State transition diagrams, PERT/CPMcharts, and entity-relationship diagrams are a few examplesof many applicationsinvolving graphs. Typically, nodes inthe graph represent items in theapplication and the edgesrepresent the relationships among these items. Agrapheditor is an interactive tool that presents a graph to theuser pictorially and allows the user to edit the graph.This monograph presentsthe design of an extendible grapheditor, which is a graph editor that canbe adapted easilyto many different application areas. Several fundamentalandrecurring problem areas associated with graph editors areinvestigated and a solution is proposed for each. The topicsinvestigated are:- Graph layout: a layout constraint mechanismis presentedwhich can easily be combined with various graphlayoutalgorithms.- Graphical abstraction: a novel clustering techniquecallededge concentration is presented which can reduce theapparentcomplexity of the graph.- Persistence: the graph structures produced by theeditorcan be kept in long-term storage using a standardized,externalformat for graphs.- Extendibility: the design of the pro |
| 出版日期 | Book 1993 |
| 关键词 | Algorithms; Cluster; Graph; Layout; Node; algorithm; complexity; combinatorics |
| 版次 | 1 |
| doi | https://doi.org/10.1007/BFb0019371 |
| isbn_softcover | 978-3-540-57090-5 |
| isbn_ebook | 978-3-540-47898-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 1993 |
发表于 2025-3-21 19:31:24
