The Design of an Extendible Graph Editor (Record no. 35521)

000 -LEADER
fixed length control field 03373nam a22005175i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540478980
-- 978-3-540-47898-0
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
245 14 - TITLE STATEMENT
Title The Design of an Extendible Graph Editor
Statement of responsibility, etc edited by Frances Newbery Paulisch.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1993.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XVI, 196 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Definition of terms -- Related work: Graph editors -- Layout algorithms and layout constraints -- Graphical abstraction -- Persistence -- Extendibility -- EDGE: An extendible graph editor -- Summary and future research -- Conclusion.
520 ## - SUMMARY, ETC.
Summary, etc Graphs can be used to convey information about relationships in many applications. State transition diagrams, PERT/CPM charts, and entity-relationship diagrams are a few examples of many applications involving graphs. Typically, nodes in the graph represent items in the application and the edges represent the relationships among these items. A graph editor is an interactive tool that presents a graph to the user pictorially and allows the user to edit the graph. This monograph presents the design of an extendible graph editor, which is a graph editor that can be adapted easily to many different application areas. Several fundamental and recurring problem areas associated with graph editors are investigated and a solution is proposed for each. The topics investigated are: - Graph layout: a layout constraint mechanism is presented which can easily be combined with various graph layout algorithms. - Graphical abstraction: a novel clustering techniquecalled edge concentration is presented which can reduce the apparent complexity of the graph. - Persistence: the graph structures produced by theeditor can be kept in long-term storage using a standardized, external format for graphs. - Extendibility: the design of the proposed graph editor makes it easy to adapt to various applications. To demonstrate their feasibility, the proposed solutions have been incorporated into EDGE, an extendible graph editor protoype.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Software engineering.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer graphics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Software Engineering.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Graphics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Programming Techniques.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Newbery Paulisch, Frances.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/BFb0019371
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1993.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK6227 http://dx.doi.org/10.1007/BFb0019371 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha