Graph Drawing (Record no. 6432)

000 -LEADER
fixed length control field 05753nam a22005535i 4500
001 - CONTROL NUMBER
control field 978-3-540-44541-8
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20141014114357.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 121227s2001 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540445418
-- 978-3-540-44541-8
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/3-540-44541-2
Source of number or code doi
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051300
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Marks, Joe.
Relator term editor.
245 10 - TITLE STATEMENT
Title Graph Drawing
Medium [electronic resource] :
Remainder of title 8th International Symposium, GD 2000 Colonial Williamsburg, VA, USA, September 20–23, 2000 Proceedings /
Statement of responsibility, etc edited by Joe Marks.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc Berlin, Heidelberg :
Name of publisher, distributor, etc Springer Berlin Heidelberg,
Date of publication, distribution, etc 2001.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2001.
300 ## - PHYSICAL DESCRIPTION
Extent XII, 422 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume number/sequential designation 1984
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Talk -- The Visual Representation of Information Structures -- Empirical Studies and Standards -- User Preference of Graph Layout Aesthetics: A UML Study -- A User Study in Similarity Measures for Graph Drawing -- Interactive Partitioning System Demonstration, Short -- An Experimental Comparison of Orthogonal Compaction Algorithms -- GraphXML — An XML-Based Graph Description Format -- Theory I -- On Polar Visibility Representations of Graphs -- A Linear Time Implementation of SPQR-Trees -- Labeling Points with Rectangles of Various Shapes -- How to Draw the Minimum Cuts of a Planar Graph -- Applications and Systems -- 2D-Structure Drawings of Similar Molecules -- Fast Layout Methods for Timetable Graphs -- An Algorithmic Framework for Visualizing Statecharts -- Visualization of the Autonomous Systems Interconnections with Hermes -- Drawing Hypergraphs in the Subset Standard (Short Demo Paper) -- Invited Talk -- Knowledge Discovery from Graphs -- Force-Directed Layout -- A Multilevel Algorithm for Force-Directed Graph Drawing -- A Fast Multi-scale Method for Drawing Large Graphs -- FADE: Graph Drawing, Clustering, and Visual Abstraction -- A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs -- GRIP: Graph dRawing with Intelligent Placement -- k-Level Graph Layout -- A Fast Layout Algorithm for k-Level Graphs -- Graph Layout for Displaying Data Structures -- k-Layer Straightline Crossing Minimization by Speeding Up Sifting -- Orthogonal Drawing I -- Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings -- Orthogonal Drawings of Cycles in 3D Space -- Three-Dimensional Orthogonal Graph Drawing with Optimal Volume -- Orthogonal Drawing II -- A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs -- Refinement of Three-Dimensional Orthogonal Graph Drawings -- Theory II -- ?-Searchlight Obedient Graph Drawings -- Unavoidable Configurations in Complete Topological Graphs -- Minimum Weight Drawings of Maximal Triangulations -- A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band -- Symmetry and Incremental Layout -- An Algorithm for Finding Three Dimensional Symmetry in Trees -- On Maximum Symmetric Subgraphs -- Clan-Based Incremental Drawing -- The Marey Graph Animation Tool Demo -- Workshop and Contest -- Graph Data Format Workshop Report -- Graph-Drawing Contest Report.
520 ## - SUMMARY, ETC.
Summary, etc This year’s meeting marked the Eighth International Symposium on Graph D- wing. The organizing and program committees worked hard to make this year’s symposium possible, and we were delighted that so many people came to - lonial Williamsburg, Virginia, for three days of the latest results in the eld of graph drawing. As in previous years, the review process was quite competitive. We accepted 30 out of 53 regular-length submissions, and 5 out of 15 short submissions, for a total acceptance ratio of 35 out of 68, or 51%. This year’s program featured several new developments in the eld. Four di erent approaches for handling very large graphs were presented in a session on force-directed layout. Two sessions were devoted to the latest advances in orthogonal graph drawing. And alongside the usual mix of theory and practice papers we had several contributions based on empirical studies of users and of systems. Our invited talks were given by two speakers who were new to most members of the GD community, but who work in areas that are closely related to graph drawing. Professor Colin Ware of the University of New Hampshire told us how knowledge of human visual perception is useful for the design of e ective data visualizations. And Professor David Jensen of the University of Massachusetts at Amherst talked about the process of knowledge discovery from graphs, a process that involves more than just graph drawing and visualization.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computational complexity.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer graphics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Combinatorics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Graphics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Combinatorics.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540415541
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 0302-9743 ;
Volume number/sequential designation 1984
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-44541-2
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-Books

No items available.


Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha