|
|
|
|
LEADER |
00000cam a2200000Mu 4500 |
001 |
EBOOKCENTRAL_ocn879025502 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr |n|---||||| |
008 |
140501s2002 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 LEAUB
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
019 |
|
|
|a 1086436979
|
020 |
|
|
|a 9789812777638
|
020 |
|
|
|a 9812777636
|
020 |
|
|
|z 9810249268
|
020 |
|
|
|z 9789810249267
|
029 |
1 |
|
|a AU@
|b 000055974308
|
029 |
1 |
|
|a DEBBG
|b BV044179536
|
029 |
1 |
|
|a DEBSZ
|b 424073420
|
035 |
|
|
|a (OCoLC)879025502
|z (OCoLC)1086436979
|
050 |
|
4 |
|a QA166.245.G73 2002
|
082 |
0 |
4 |
|a 005.1
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Tamassia, Roberto.
|
245 |
1 |
0 |
|a Graph Algorithms and Applications 1.
|
260 |
|
|
|a Singapore :
|b World Scientific Publishing Company,
|c 2002.
|
300 |
|
|
|a 1 online resource (440 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 1-3 of the Journal of Graph Algorithms and Applications (JGAA) . Topics of interest include design and analysis of graph algorithms, experiences with graph algorithms, and applications of graph algorithms. JGAA is supported by distinguished advisory and editorial boards, has high scientific standards, and takes advantage of current electronic document technology. The electronic version of JGAA is available on the Web at http://www.cs.brown.edu/publications/jgaa/. Contents: Volume 1: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algori.
|
505 |
0 |
|
|a Volume 1:1-3 (1997) ; 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms ; 1 Introduction ; 2 Branch and Cut for One Sided Crossing Minimization ; 3 One Sided Crossing Minimization ; 4 Two Sided Crossing Minimization ; 5 Conclusions.
|
505 |
8 |
|
|a Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction Max Cut and Coloring 1 Introduction ; 2 Preliminaries ; 3 Simple Local Search ; 4 Modified Local Search ; 5 Applications to Induced Subgraph Problems and Graph Coloring ; References.
|
505 |
8 |
|
|a Volume 2:1-8 (1998) Algorithms for Cluster Busting in Anchored Graph Drawing ; 1 Introduction ; 2 Related Work ; 3 Measuring Similarity and Distribution ; 4 The Layout Algorithms ; 5 Results ; 6 Conclusions and Future Work ; References.
|
505 |
8 |
|
|a A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs 1 Introduction ; 2 Preliminaries ; 3 Broadcasting Algorithm ; 4 Conclusion ; References ; A Visibility Representation for Graphs in Three Dimensions ; 1 Introduction ; 2 An Upper Bound ; 3 A Lower Bound.
|
504 |
|
|
|a Includes bibliographical references.
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Graph algorithms.
|
650 |
|
6 |
|a Algorithmes de graphes.
|
650 |
|
7 |
|a Graph algorithms
|2 fast
|
700 |
1 |
|
|a Tollis, Ioannis G.
|
758 |
|
|
|i has work:
|a Graph algorithms and applications I (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCGDtKT7jj6WxGYdg9Qf9CP
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
776 |
0 |
8 |
|i Print version:
|z 9789810249267
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1681583
|z Texto completo
|
938 |
|
|
|a EBL - Ebook Library
|b EBLB
|n EBL1681583
|
994 |
|
|
|a 92
|b IZTAP
|