LEADER 05163nam 2200637 a 450 001 9910454074203321 005 20200520144314.0 010 $a1-281-92976-X 010 $a9786611929763 010 $a981-277-763-6 035 $a(CKB)1000000000537936 035 $a(EBL)1681583 035 $a(OCoLC)879025502 035 $a(SSID)ssj0000165084 035 $a(PQKBManifestationID)11152116 035 $a(PQKBTitleCode)TC0000165084 035 $a(PQKBWorkID)10141792 035 $a(PQKB)10621660 035 $a(MiAaPQ)EBC1681583 035 $a(WSP)00004938 035 $a(Au-PeEL)EBL1681583 035 $a(CaPaEBR)ebr10255727 035 $a(EXLCZ)991000000000537936 100 $a20021017d2002 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aGraph algorithms and applications I$b[electronic resource] /$feditors, Roberto Tamassia, Ioannis G. Tollis 210 $aRiver Edge, N.J. $cWorld Scientific$dc2002 215 $a1 online resource (439 p.) 300 $aIssues for 2006- cataloged as a serial in LC.$5DLC 300 $a"Contains volumes 1-3 of the Journal of graph algorithms and applications (JGAA)"--Pref. 311 $a981-02-4926-8 320 $aIncludes bibliographical references. 327 $aContents ; 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 327 $aReferences Optimal Algorithms to Embed Trees in a Point Set ; 1 Introduction ; 2 Hull Trees ; 3 Embedding a Rooted Tree with the Root on the Convex Hull ; 4 Embedding a Rooted Tree ; 5 Finding Degree-constrained Embeddings ; 6 Lower Bounds ; References 327 $aLow-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 327 $aVolume 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 327 $aA 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 327 $a4 Additional Results 330 $aThis 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: