Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Berlin u.a. : Springer
    UID:
    b3kat_BV035719969
    Format: 1 Online-Ressource (XIII, 184 S. , graph. Darst.)
    ISBN: 354057090X , 038757090X
    Series Statement: Lecture notes in computer science 704
    Note: Zugl.: Karlsruhe, Univ., Diss., 1991
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Graphischer Editor ; Graph ; Editor ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Berlin [u.a.] : Springer
    UID:
    gbv_595126324
    Format: Online-Ressource (XIII, 184 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540478980
    Series Statement: Lecture notes in computer science 704
    Content: 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.
    Content: 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.
    Note: Zugl.: Karlsruhe, Univ., Diss., 1991
    Additional Edition: ISBN 354057090X
    Additional Edition: ISBN 9783540570905
    Additional Edition: Druckausg. Paulisch, Frances Newbery The design of an extendible graph editor Berlin : Springer, 1993 ISBN 354057090X
    Additional Edition: ISBN 038757090X
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Graphischer Editor ; Hochschulschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almafu_9959186113002883
    Format: 1 online resource (XVI, 196 p.)
    Edition: 1st ed. 1993.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47898-1
    Series Statement: Lecture Notes in Computer Science, 704
    Content: 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.
    Note: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-57090-X
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Berlin, Heidelberg : Springer Berlin Heidelberg
    UID:
    gbv_1649300387
    Format: Online-Ressource
    ISBN: 9783540478980
    Series Statement: Lecture Notes in Computer Science 704
    Additional Edition: ISBN 9783540570905
    Additional Edition: Buchausg. u.d.T. Paulisch, Frances Newbery The design of an extendible graph editor Berlin : Springer, 1993 ISBN 354057090X
    Additional Edition: ISBN 038757090X
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Graphischer Editor
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Book
    Book
    Berlin u.a. : Springer
    UID:
    b3kat_BV008271922
    Format: XIII, 184 S. , graph. Darst.
    ISBN: 354057090X , 038757090X
    Series Statement: Lecture notes in computer science 704
    Note: Zugl.: Karlsruhe, Univ., Diss., 1991
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Graphischer Editor ; Graph ; Editor ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Book
    Book
    Berlin u.a. :Springer,
    UID:
    almahu_BV008271922
    Format: XIII, 184 S. : graph. Darst.
    ISBN: 3-540-57090-X , 0-387-57090-X
    Series Statement: Lecture notes in computer science 704
    Note: Zugl.: Karlsruhe, Univ., Diss., 1991
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Graphischer Editor ; Graph ; Editor ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Book
    Book
    Berlin u.a. :Springer,
    UID:
    almafu_BV008271922
    Format: XIII, 184 S. : graph. Darst.
    ISBN: 3-540-57090-X , 0-387-57090-X
    Series Statement: Lecture notes in computer science 704
    Note: Zugl.: Karlsruhe, Univ., Diss., 1991
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Graphischer Editor ; Graph ; Editor ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Book
    Book
    Berlin : Springer
    UID:
    gbv_272030481
    Format: XIII, 184 S. , graph. Darst.
    ISBN: 354057090X , 038757090X
    Series Statement: Lecture notes in computer science 704
    Note: Literaturverz. S. [171] - 181 , Zugl.: Karlsruhe, Univ., Diss., 1991
    Additional Edition: Online-Ausg. Paulisch, Frances N. The Design of an Extendible Graph Editor Berlin, Heidelberg : Springer Berlin Heidelberg, 1993 ISBN 9783540478980
    Additional Edition: Online-Ausg. Paulisch, Frances Newbery The design of an extendible graph editor Berlin [u.a.] : Springer, 1993 ISBN 9783540478980
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Graphischer Editor ; Hochschulschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    UID:
    almahu_9947921012902882
    Format: XVI, 196 p. , online resource.
    ISBN: 9783540478980
    Series Statement: Lecture Notes in Computer Science, 704
    Content: 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.
    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.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540570905
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almahu_9948621706202882
    Format: XVI, 196 p. , online resource.
    Edition: 1st ed. 1993.
    ISBN: 9783540478980
    Series Statement: Lecture Notes in Computer Science, 704
    Content: 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.
    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.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662206669
    Additional Edition: Printed edition: ISBN 9783540570905
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 354050060x?
Did you mean 351057009x?
Did you mean 354007080x?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages