Graph algorithms and applications 2 /:
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-qual...
Gespeichert in:
| Weitere Verfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
River Edge, N.J. :
World Scientific,
2004.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design. The journal 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:/ /jgaa.info/. Graph Algorithms and Applications 2 presents contributions from prominent authors and includes selected papers from the Dagstuhl Seminar on Graph Algorithms and Applications and the Symposium on Graph Drawing in 1998. All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications. |
| Beschreibung: | 1 online resource (xi, 521 pages) : illustrations |
| Bibliographie: | Includes bibliographical references. |
| ISBN: | 9789812794741 9812794743 1281934631 9781281934635 9786611934637 6611934634 |
Internformat
MARC
| LEADER | 00000cam a2200000Ma 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn646768721 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 050207s2004 njua ob 000 0 eng d | ||
| 040 | |a E7B |b eng |e pn |c E7B |d CEF |d OCLCQ |d N$T |d UBY |d IDEBK |d OCLCQ |d OCLCF |d OCLCO |d YDXCP |d OCLCQ |d AZK |d COCUF |d AGLDB |d MOR |d PIFAG |d OCLCQ |d JBG |d OCLCQ |d U3W |d STF |d WRM |d OCLCQ |d VTS |d NRAMU |d INT |d VT2 |d OCLCQ |d M8D |d UKAHL |d HS0 |d UKCRE |d VLY |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
| 019 | |a 262616211 |a 505148169 |a 764501299 |a 815752351 |a 961529950 |a 962725668 |a 988484439 |a 992106311 |a 1037702033 |a 1038632728 |a 1045512918 |a 1055367133 |a 1081253122 |a 1153530901 |a 1162252867 |a 1241917951 |a 1290048817 |a 1300684375 | ||
| 020 | |a 9789812794741 |q (electronic bk.) | ||
| 020 | |a 9812794743 |q (electronic bk.) | ||
| 020 | |a 1281934631 | ||
| 020 | |a 9781281934635 | ||
| 020 | |z 9812388559 |q (pbk.) | ||
| 020 | |z 9789812388551 |q (pbk.) | ||
| 020 | |a 9786611934637 | ||
| 020 | |a 6611934634 | ||
| 035 | |a (OCoLC)646768721 |z (OCoLC)262616211 |z (OCoLC)505148169 |z (OCoLC)764501299 |z (OCoLC)815752351 |z (OCoLC)961529950 |z (OCoLC)962725668 |z (OCoLC)988484439 |z (OCoLC)992106311 |z (OCoLC)1037702033 |z (OCoLC)1038632728 |z (OCoLC)1045512918 |z (OCoLC)1055367133 |z (OCoLC)1081253122 |z (OCoLC)1153530901 |z (OCoLC)1162252867 |z (OCoLC)1241917951 |z (OCoLC)1290048817 |z (OCoLC)1300684375 | ||
| 050 | 4 | |a QA166.245 |b .G73 2004eb | |
| 072 | 7 | |a MAT |x 013000 |2 bisacsh | |
| 072 | 7 | |a UMB |2 bicssc | |
| 082 | 7 | |a 511.5 |2 22 | |
| 049 | |a MAIN | ||
| 245 | 0 | 0 | |a Graph algorithms and applications 2 / |c Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis. |
| 246 | 3 | |a Graph algorithms and applications two | |
| 260 | |a River Edge, N.J. : |b World Scientific, |c 2004. | ||
| 300 | |a 1 online resource (xi, 521 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 504 | |a Includes bibliographical references. | ||
| 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, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design. The journal 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:/ /jgaa.info/. Graph Algorithms and Applications 2 presents contributions from prominent authors and includes selected papers from the Dagstuhl Seminar on Graph Algorithms and Applications and the Symposium on Graph Drawing in 1998. All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications. | ||
| 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) | |
| 546 | |a English. | ||
| 650 | 0 | |a Graph algorithms. |0 http://id.loc.gov/authorities/subjects/sh2002004605 | |
| 650 | 0 | |a Mathematics. |0 http://id.loc.gov/authorities/subjects/sh85082139 | |
| 650 | 2 | |a Mathematics |0 https://id.nlm.nih.gov/mesh/D008433 | |
| 650 | 6 | |a Algorithmes de graphes. | |
| 650 | 6 | |a Mathématiques. | |
| 650 | 7 | |a MATHEMATICS |x Graphic Methods. |2 bisacsh | |
| 650 | 7 | |a Graph algorithms |2 fast | |
| 650 | 7 | |a Mathematics |2 fast | |
| 700 | 1 | |a Liotta, Giuseppe. |0 http://id.loc.gov/authorities/names/n84155332 | |
| 700 | 1 | |a Tamassia, Roberto, |d 1960- |1 https://id.oclc.org/worldcat/entity/E39PBJhxq7Wb4F3F6694WyBpT3 |0 http://id.loc.gov/authorities/names/n94122376 | |
| 700 | 1 | |a Tollis, Ioannis G., |d 1958- |1 https://id.oclc.org/worldcat/entity/E39PCjFmvVyqf97q3hFKvB9crq |0 http://id.loc.gov/authorities/names/n94122378 | |
| 730 | 0 | |a Journal of graph algorithms and applications. | |
| 776 | 0 | 8 | |i Print version: |t Graph algorithms and applications 2. |d River Edge, N.J. : World Scientific, 2004 |z 9812388559 |z 9789812388551 |w (OCoLC)57583140 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235574 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH24685128 | ||
| 938 | |a ebrary |b EBRY |n ebr10255778 | ||
| 938 | |a EBSCOhost |b EBSC |n 235574 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 193463 | ||
| 938 | |a YBP Library Services |b YANK |n 2892016 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn646768721 |
|---|---|
| _version_ | 1816881725256499200 |
| adam_text | |
| any_adam_object | |
| author2 | Liotta, Giuseppe Tamassia, Roberto, 1960- Tollis, Ioannis G., 1958- |
| author2_role | |
| author2_variant | g l gl r t rt i g t ig igt |
| author_GND | http://id.loc.gov/authorities/names/n84155332 http://id.loc.gov/authorities/names/n94122376 http://id.loc.gov/authorities/names/n94122378 |
| author_facet | Liotta, Giuseppe Tamassia, Roberto, 1960- Tollis, Ioannis G., 1958- |
| author_sort | Liotta, Giuseppe |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166.245 .G73 2004eb |
| callnumber-search | QA166.245 .G73 2004eb |
| callnumber-sort | QA 3166.245 G73 42004EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | 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) 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 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 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) 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) |
| ctrlnum | (OCoLC)646768721 |
| dewey-full | 511.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.5 |
| dewey-search | 511.5 |
| dewey-sort | 3511.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06172cam a2200721Ma 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn646768721</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">050207s2004 njua ob 000 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">E7B</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">E7B</subfield><subfield code="d">CEF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">UBY</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCO</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AZK</subfield><subfield code="d">COCUF</subfield><subfield code="d">AGLDB</subfield><subfield code="d">MOR</subfield><subfield code="d">PIFAG</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">JBG</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">U3W</subfield><subfield code="d">STF</subfield><subfield code="d">WRM</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">NRAMU</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">HS0</subfield><subfield code="d">UKCRE</subfield><subfield code="d">VLY</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">262616211</subfield><subfield code="a">505148169</subfield><subfield code="a">764501299</subfield><subfield code="a">815752351</subfield><subfield code="a">961529950</subfield><subfield code="a">962725668</subfield><subfield code="a">988484439</subfield><subfield code="a">992106311</subfield><subfield code="a">1037702033</subfield><subfield code="a">1038632728</subfield><subfield code="a">1045512918</subfield><subfield code="a">1055367133</subfield><subfield code="a">1081253122</subfield><subfield code="a">1153530901</subfield><subfield code="a">1162252867</subfield><subfield code="a">1241917951</subfield><subfield code="a">1290048817</subfield><subfield code="a">1300684375</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789812794741</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9812794743</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1281934631</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781281934635</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9812388559</subfield><subfield code="q">(pbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9789812388551</subfield><subfield code="q">(pbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786611934637</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6611934634</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)646768721</subfield><subfield code="z">(OCoLC)262616211</subfield><subfield code="z">(OCoLC)505148169</subfield><subfield code="z">(OCoLC)764501299</subfield><subfield code="z">(OCoLC)815752351</subfield><subfield code="z">(OCoLC)961529950</subfield><subfield code="z">(OCoLC)962725668</subfield><subfield code="z">(OCoLC)988484439</subfield><subfield code="z">(OCoLC)992106311</subfield><subfield code="z">(OCoLC)1037702033</subfield><subfield code="z">(OCoLC)1038632728</subfield><subfield code="z">(OCoLC)1045512918</subfield><subfield code="z">(OCoLC)1055367133</subfield><subfield code="z">(OCoLC)1081253122</subfield><subfield code="z">(OCoLC)1153530901</subfield><subfield code="z">(OCoLC)1162252867</subfield><subfield code="z">(OCoLC)1241917951</subfield><subfield code="z">(OCoLC)1290048817</subfield><subfield code="z">(OCoLC)1300684375</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA166.245</subfield><subfield code="b">.G73 2004eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">013000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UMB</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Graph algorithms and applications 2 /</subfield><subfield code="c">Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis.</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">Graph algorithms and applications two</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">River Edge, N.J. :</subfield><subfield code="b">World Scientific,</subfield><subfield code="c">2004.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xi, 521 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design. The journal 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:/ /jgaa.info/. Graph Algorithms and Applications 2 presents contributions from prominent authors and includes selected papers from the Dagstuhl Seminar on Graph Algorithms and Applications and the Symposium on Graph Drawing in 1998. All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="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)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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)</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2002004605</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematics.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85082139</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Mathematics</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D008433</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes de graphes.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Mathématiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Graphic Methods.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liotta, Giuseppe.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n84155332</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tamassia, Roberto,</subfield><subfield code="d">1960-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJhxq7Wb4F3F6694WyBpT3</subfield><subfield code="0">http://id.loc.gov/authorities/names/n94122376</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tollis, Ioannis G.,</subfield><subfield code="d">1958-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjFmvVyqf97q3hFKvB9crq</subfield><subfield code="0">http://id.loc.gov/authorities/names/n94122378</subfield></datafield><datafield tag="730" ind1="0" ind2=" "><subfield code="a">Journal of graph algorithms and applications.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Graph algorithms and applications 2.</subfield><subfield code="d">River Edge, N.J. : World Scientific, 2004</subfield><subfield code="z">9812388559</subfield><subfield code="z">9789812388551</subfield><subfield code="w">(OCoLC)57583140</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235574</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH24685128</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10255778</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">235574</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">193463</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2892016</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn646768721 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:17:17Z |
| institution | BVB |
| isbn | 9789812794741 9812794743 1281934631 9781281934635 9786611934637 6611934634 |
| language | English |
| oclc_num | 646768721 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xi, 521 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | World Scientific, |
| record_format | marc |
| spelling | Graph algorithms and applications 2 / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis. Graph algorithms and applications two River Edge, N.J. : World Scientific, 2004. 1 online resource (xi, 521 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references. Print version record. 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, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design. The journal 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:/ /jgaa.info/. Graph Algorithms and Applications 2 presents contributions from prominent authors and includes selected papers from the Dagstuhl Seminar on Graph Algorithms and Applications and the Symposium on Graph Drawing in 1998. All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications. 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) 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 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 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) 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) English. Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Mathematics. http://id.loc.gov/authorities/subjects/sh85082139 Mathematics https://id.nlm.nih.gov/mesh/D008433 Algorithmes de graphes. Mathématiques. MATHEMATICS Graphic Methods. bisacsh Graph algorithms fast Mathematics fast Liotta, Giuseppe. http://id.loc.gov/authorities/names/n84155332 Tamassia, Roberto, 1960- https://id.oclc.org/worldcat/entity/E39PBJhxq7Wb4F3F6694WyBpT3 http://id.loc.gov/authorities/names/n94122376 Tollis, Ioannis G., 1958- https://id.oclc.org/worldcat/entity/E39PCjFmvVyqf97q3hFKvB9crq http://id.loc.gov/authorities/names/n94122378 Journal of graph algorithms and applications. Print version: Graph algorithms and applications 2. River Edge, N.J. : World Scientific, 2004 9812388559 9789812388551 (OCoLC)57583140 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235574 Volltext |
| spellingShingle | Graph algorithms and applications 2 / 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) 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 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 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) 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) Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Mathematics. http://id.loc.gov/authorities/subjects/sh85082139 Mathematics https://id.nlm.nih.gov/mesh/D008433 Algorithmes de graphes. Mathématiques. MATHEMATICS Graphic Methods. bisacsh Graph algorithms fast Mathematics fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh2002004605 http://id.loc.gov/authorities/subjects/sh85082139 https://id.nlm.nih.gov/mesh/D008433 |
| title | Graph algorithms and applications 2 / |
| title_alt | Graph algorithms and applications two Journal of graph algorithms and applications. |
| title_auth | Graph algorithms and applications 2 / |
| title_exact_search | Graph algorithms and applications 2 / |
| title_full | Graph algorithms and applications 2 / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis. |
| title_fullStr | Graph algorithms and applications 2 / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis. |
| title_full_unstemmed | Graph algorithms and applications 2 / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis. |
| title_short | Graph algorithms and applications 2 / |
| title_sort | graph algorithms and applications 2 |
| topic | Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Mathematics. http://id.loc.gov/authorities/subjects/sh85082139 Mathematics https://id.nlm.nih.gov/mesh/D008433 Algorithmes de graphes. Mathématiques. MATHEMATICS Graphic Methods. bisacsh Graph algorithms fast Mathematics fast |
| topic_facet | Graph algorithms. Mathematics. Mathematics Algorithmes de graphes. Mathématiques. MATHEMATICS Graphic Methods. Graph algorithms |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235574 |
| work_keys_str_mv | UT journalofgraphalgorithmsandapplications AT liottagiuseppe graphalgorithmsandapplications2 AT tamassiaroberto graphalgorithmsandapplications2 AT tollisioannisg graphalgorithmsandapplications2 AT liottagiuseppe graphalgorithmsandapplicationstwo AT tamassiaroberto graphalgorithmsandapplicationstwo AT tollisioannisg graphalgorithmsandapplicationstwo |