|
|
|
|
LEADER |
00000cam a2200000Mi 4500 |
001 |
EBOOKCENTRAL_ocn879024806 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr |n|---||||| |
008 |
140501s2004 si o 000 0 eng d |
040 |
|
|
|a MHW
|b eng
|e pn
|c MHW
|d EBLCP
|d OCLCQ
|d DEBSZ
|d OCLCQ
|d ZCU
|d MERUC
|d ICG
|d OCLCO
|d OCLCF
|d AU@
|d OCLCQ
|d DKC
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|
020 |
|
|
|a 9789812794741
|
020 |
|
|
|a 9812794743
|
029 |
1 |
|
|a AU@
|b 000055974170
|
029 |
1 |
|
|a DEBBG
|b BV044179204
|
029 |
1 |
|
|a DEBSZ
|b 424073323
|
029 |
1 |
|
|a DEBSZ
|b 445581247
|
035 |
|
|
|a (OCoLC)879024806
|
050 |
|
4 |
|a QA166.245.G73 2004
|
082 |
0 |
4 |
|a 005.1
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Liotta, Giuseppe.
|
245 |
1 |
0 |
|a Graph Algorithms and Applications 2 :
|b Solid-Electrolyte Interphase.
|
260 |
|
|
|a Singapore :
|b World Scientific Publishing Company,
|c 2004.
|
300 |
|
|
|a 1 online resource (532 pages)
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
588 |
0 |
|
|a Print version record.
|
520 |
|
|
|a This book contains Volumes 4 and 5 of the Journal of Graph Algorithms and Applications (JGAA) . The first book of this series, Graph Algorithms and Applications 1, published in March 2002, contains Volumes 1-3 of JGAA . JGAA is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing.
|
505 |
0 |
|
|a Volume 4:1 (2000) ; Approximations of Weighted Independent Set and Hereditary Subset Problems ; Volume 4:2 (2000) ; Approximation Algorithms for Some Graph Partitioning Problems ; Volume 4:3 (2000).
|
505 |
8 |
|
|a Advances in Graph Drawing Special Issue on Selected Papers from the Sixth International Symposium on Graph Drawing GD'98 Guest Editors' Foreword Geometric Thickness of Complete Graphs ; Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs.
|
505 |
8 |
|
|a Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms Techniques for the Refinement of Orthogonal Graph Drawings ; A Split & Push Approach to 3D Orthogonal Drawing ; Using Graph Layout to Visualize Train Interconnection Data.
|
505 |
8 |
|
|a Navigating Clustered Graphs Using Force-Directed Methods Dynamic WWW Structures in 3D ; Volume 4:4 (2000) ; Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees ; Volume 5:1 (2001) ; Planarizing Graphs -- A Survey and Annotated Bibliography ; Volume 5:2 (2001).
|
505 |
8 |
|
|a Fully Dynamic 3-Dimensional Orthogonal Graph Drawing Volume 5:3 (2001) ; 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved ; Volume 5:4 (2001) ; Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems ; Volume 5:5 (2001).
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Graph algorithms.
|
650 |
|
0 |
|a Mathematics.
|
650 |
|
2 |
|a Mathematics
|
650 |
|
6 |
|a Algorithmes de graphes.
|
650 |
|
6 |
|a Mathématiques.
|
650 |
|
7 |
|a Graph algorithms
|2 fast
|
650 |
|
7 |
|a Mathematics
|2 fast
|
700 |
1 |
|
|a Tamassia, Roberto.
|
700 |
1 |
|
|a Tollis, Ioannis G.
|
776 |
0 |
8 |
|i Print version:
|z 9789812388551
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1681078
|z Texto completo
|
938 |
|
|
|a EBL - Ebook Library
|b EBLB
|n EBL1681078
|
994 |
|
|
|a 92
|b IZTAP
|