Graph Drawing (Record no. 36613)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 05094nam a22005775i 4500 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9783540696742 |
-- | 978-3-540-69674-2 |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 004.0151 |
245 10 - TITLE STATEMENT | |
Title | Graph Drawing |
Sub Title | 5th International Symposium, GD '97 Rome, Italy, September 18–20, 1997 Proceedings / |
Statement of responsibility, etc | edited by Giuseppe DiBattista. |
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
Place of publication | Berlin, Heidelberg : |
Name of publisher | Springer Berlin Heidelberg, |
Year of publication | 1997. |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | XII, 456 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 | Drawable and forbidden minimum weight triangulations -- A polyhedral approach to the multi-layer crossing minimization problem -- On embedding an outer-planar graph in a point set -- Bipartite crossing numbers of meshes and hypercubes -- Three-dimensional grid drawings of graphs -- Incremental orthogonal graph drawing in three dimensions -- On three-dimensional layout of interconnection networks -- Orthogonal 3-D graph drawing -- Finding the best viewpoints for three-dimensional graph drawings -- A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs -- Interactive orthogonal graph drawing: Algorithms and bounds -- Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard -- Algorithms and area bounds for nonplanar orthogonal drawings -- Drawing clustered graphs on an orthogonal grid -- Graph clustering I: Cycles of cliques -- An algorithm for labeling edges of hierarchical drawings -- Elastic labels: The two-axis case -- Pitfalls of using PQ-trees in automatic graph drawing -- Graph drawing with no k pairwise crossing edges -- Area requirements for drawing hierarchically planar graphs -- A short proof of a Gauss problem -- A bayesian paradigm for dynamic graph layout -- Which aesthetic has the greatest effect on human understanding? -- Implementing a general-purpose edge router -- The wobbly logic engine: Proving hardness of non-rigid geometric graph representation problems -- 3DCube: A tool for three dimensional graph drawing -- Graph clustering using multiway ratio cut (Software demonstration) -- ArchE: A graph drawing system for archaeology -- InteractiveGiotto: An algorithm for interactive orthogonal graph drawing -- GRID: An interactive tool for computing orthogonal drawings with the minimum number of bends -- Lexical navigation: Using incremental graph drawing for query refinement -- Design gallery browsers based on 2D and 3D graph drawing (Demo) -- Online animated graph drawing for web navigation -- Grappa: A graph package in java -- GraVis — System demonstration -- Touching graphs of unit balls -- Discrete realizations of contact and intersection graphs (extended abstract) -- Minimum-area h-v drawings of complete binary trees -- Packing trees into planar graphs -- The three-phase method: A unified approach to orthogonal graph drawing -- NicheWorks — Interactive visualization of very large graphs -- Extending the Sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams -- Graph drawing and manipulation with LINK -- Graph-drawing contest report. |
520 ## - SUMMARY, ETC. | |
Summary, etc | This book constitutes the strictly refereed post-conference proceedings of the 5th International Symposium on Graph Drawing, GD'97, held in Rome, Italy, in September 1997. The 33 revised full papers and 10 systems demonstrations presented were selected from 80 submissions. The topics covered include planarity, crossing theory, three dimensional representations, orthogonal representations, clustering and labeling problems, packing problems, general methodologies, and systems and applications. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer science. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer software. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computational complexity. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer graphics. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Visualization. |
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 | Discrete Mathematics in Computer Science. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Combinatorics. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Algorithm Analysis and Problem Complexity. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer Graphics. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Visualization. |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | DiBattista, Giuseppe. |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | http://dx.doi.org/10.1007/3-540-63938-1 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | E-BOOKS |
264 #1 - | |
-- | Berlin, Heidelberg : |
-- | Springer Berlin Heidelberg, |
-- | 1997. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
-- | 0302-9743 ; |
Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Accession Number | Uniform Resource Identifier | Koha item type |
---|---|---|---|---|---|---|---|
IMSc Library | EBK7319 | http://dx.doi.org/10.1007/3-540-63938-1 | E-BOOKS |