LEADER 04644nam 2200661Ia 450 001 9910450789603321 005 20200520144314.0 010 $a1-281-92466-0 010 $a9786611924669 010 $a981-277-328-2 035 $a(CKB)1000000000412990 035 $a(EBL)1681586 035 $a(OCoLC)879025514 035 $a(SSID)ssj0000165083 035 $a(PQKBManifestationID)11160932 035 $a(PQKBTitleCode)TC0000165083 035 $a(PQKBWorkID)10141888 035 $a(PQKB)10840071 035 $a(MiAaPQ)EBC1681586 035 $a(WSP)00006143 035 $a(Au-PeEL)EBL1681586 035 $a(CaPaEBR)ebr10201229 035 $a(CaONFJC)MIL192466 035 $a(EXLCZ)991000000000412990 100 $a20061019d2006 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aGraph algorithms and applications 5$b[electronic resource] /$feditors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis 210 $aSingapore ;$aHackensack, N.J. $cWorld Scientific$dc2006 215 $a1 online resource (378 p.) 300 $a"This book contains volume 8 of the Journal of graph algorithms and applications (JGAA)"--Pref. 311 $a981-256-845-X 320 $aIncludes bibliographical references. 327 $aContents ; Volume 8:1 (2004) ; Drawing Planar Graphs with Large Vertices and Thick Edges ; The Maximum Number of Edges in a Three-Dimensional Grid-Drawing ; Extreme Distances in Multicolored Point Sets ; Fast Approximation of Centrality ; I/O-Optimal Algorithms for Outerplanar Graphs 327 $aA Note on Rectilinearity and Angular Resolution The Star Clustering Algorithm for Static and Dynamic Information Organization ; Volume 8:2 (2004) ; Special Issue on Selected Papers from the Tenth International Symposium on Graph Drawing GD 2002 327 $aStraight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio Drawing Graphs on Two and Three Lines. Sabine Cornelsen Thomas Schank and Dorothea Wagner ; Simple and Efficient Bilayer Cross Counting. Wilhelm Barth Petra Mutzel and Michael Jiinger 327 $aGraph Drawing by High-Dimensional Embedding Computing and Drawing Isomorphic Subgraphs ; Volume 8:3 (2004) ; On the Cutting Edge: Simplified O(n) Planarity by Edge Addition ; Algorithms for Single Link Failure Recovery and Related Problems 327 $aNP-Completeness of Minimal Width Unordered Tree Layout Algorithm and Experiments in Testing Planar Graphs for Isomorphism ; Three-Dimensional 1-Bend Graph Drawings 330 $a This book contains Volume 8 of the Journal of Graph Algorithms and Applications (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, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications ne 606 $aGraph algorithms 606 $aGraph theory 608 $aElectronic books. 615 0$aGraph algorithms. 615 0$aGraph theory. 676 $a005.133 701 $aLiotta$b Giuseppe$0229451 701 $aTamassia$b Roberto$f1960-$0305485 701 $aTollis$b Ioannis G.$f1958-$0855160 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910450789603321 996 $aGraph algorithms and applications 5$91924294 997 $aUNINA