Graph algorithms and applications 3 /:
This book contains Volume 6 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 compu...
Gespeichert in:
Weitere Verfasser: | , , |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Singapore ; River Edge, N.J. :
World Scientific,
2004.
|
Schlagworte: | |
Online-Zugang: | Volltext |
Zusammenfassung: | This book contains Volume 6 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 networks, user interfaces and visualization, and VLSI circuit design. Graph Algorithms and Applications 3 presents contributions from prominent authors and includes selected papers from the Symposium on Graph Drawing (1999 and 2000). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications. |
Beschreibung: | "This book contains volume 6 of the Journal of graph algorithms and applications (JGAA)"--Preface |
Beschreibung: | 1 online resource (x, 404 pages) : illustrations |
Bibliographie: | Includes bibliographical references. |
ISBN: | 9789812796608 9812796606 128195599X 9781281955999 |
Internformat
MARC
LEADER | 00000cam a2200000 a 4500 | ||
---|---|---|---|
001 | ZDB-4-EBA-ocn263165317 | ||
003 | OCoLC | ||
005 | 20241004212047.0 | ||
006 | m o d | ||
007 | cr cnu---unuuu | ||
008 | 081023s2004 si a ob 000 0 eng d | ||
040 | |a N$T |b eng |e pn |c N$T |d OCLCQ |d IDEBK |d OCLCQ |d OCLCF |d EBLCP |d DEBSZ |d OCLCQ |d NLGGC |d YDXCP |d OCLCQ |d COCUF |d ZCU |d OCLCQ |d MERUC |d U3W |d OCLCQ |d VTS |d AGLDB |d ICG |d INT |d OCLCQ |d STF |d DKC |d AU@ |d OCLCQ |d M8D |d UKAHL |d OCLCQ |d K6U |d LEAUB |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d SXB |d OCLCQ |d OCLCO | ||
019 | |a 815755877 |a 1086526519 | ||
020 | |a 9789812796608 |q (electronic bk.) | ||
020 | |a 9812796606 |q (electronic bk.) | ||
020 | |a 128195599X | ||
020 | |a 9781281955999 | ||
020 | |z 9812389393 | ||
020 | |z 9789812389398 | ||
035 | |a (OCoLC)263165317 |z (OCoLC)815755877 |z (OCoLC)1086526519 | ||
050 | 4 | |a QA166.245 |b .G7 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 3 / |c Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis. |
246 | 3 | |a Graph algorithms and applications three | |
260 | |a Singapore ; |a River Edge, N.J. : |b World Scientific, |c 2004. | ||
300 | |a 1 online resource (x, 404 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 | ||
500 | |a "This book contains volume 6 of the Journal of graph algorithms and applications (JGAA)"--Preface | ||
504 | |a Includes bibliographical references. | ||
588 | 0 | |a Print version record. | |
520 | |a This book contains Volume 6 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 networks, user interfaces and visualization, and VLSI circuit design. Graph Algorithms and Applications 3 presents contributions from prominent authors and includes selected papers from the Symposium on Graph Drawing (1999 and 2000). 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 6:1 (2002). Special issue on graph drawing and representations: selected papers from the 1999 symposium on graph drawing. Guest editors: Hubert de Praysseix and Jan Kratochvil. Guest editors' foreword / Hubert de Fraysseix and Jan Kratochvil. Triangle-free planar graphs and segment intersection graphs / Natalia de Castro [and others]. Communicated by Hubert de Fraysseix and Jan Kratochvil. Planar graphs with topological constraints / Christoph Dornheim. Communicated by Hubert de Fraysseix and Jan Kratochvil. Level planar embedding in linear time / Michael Jünger and Sebastian Leipert. Communicated by Hubert de Fraysseix and Jan Kratochvil. Embedding vertices at points: few bends suffice for planar graphs / Michael Kaufmann and Roland Wiese. Communicated by Hubert de Fraysseix and Jan Kratochvil. Art of graph drawing and art / Jaroslav Nešetřil. Communicated by Hubert de Fraysseix and Jan Kratochvil. Realization of Posets / Patrice Ossona de Mendez. Communicated by Hubert de Fraysseix and Jan Kratochvil -- Volume 6:2 (2002). Traversing directed Eulerian mazes / S. Bhatt [and others]. Communicated by Samir Khuller -- Volume 6:3 (2002). Special issue on selected papers from the 2000 symposium on graph drawing. Guest editors: Michael Kaufmann. Guest editor's foreword / Michael Kaufmann. A fast multi-scale method for drawing large graphs / David Harel and Yehuda Koren. Communicated by Michael Kaufmann. GRIP: graph drawing with intelligent placement / Pawel Gajer and Stephen G. Kobourov. Communicated by Michael Kaufmann. A user study in similarity measures for graph drawing / Stina Bridgeman and Roberto Tamassia. Communicated by Michael Kaufmann. Graph layout aesthetics in UML diagrams: user preferences / Helen C. Purchase, Jo-Anne Allder and David Carrington. Communicated by Michael Kaufmann. Visualization of the high level structure of the internet with Hermes / Andrea Carmignani [and others]. Communicated by Michael Kaufmann. A framework for the static and interactive visualization of statecharts / Rodolfo Castelló, Rym Mili and Ioannis G. Tollis. Communicated by Michael Kaufmann. Graph drawing in motion / Carsten Friedrich and Peter Eades. Communicated by Michael Kaufmann -- Volume 6:4 (2002). A 6-regular Torus graph family with applications to cellular and interconnection networks / Mihaela Iridon and David W. Matula. Communicated by Balaji Raghavachari. | |
650 | 0 | |a Graph algorithms. |0 http://id.loc.gov/authorities/subjects/sh2002004605 | |
650 | 0 | |a Graph theory. |0 http://id.loc.gov/authorities/subjects/sh85056471 | |
650 | 6 | |a Algorithmes de graphes. | |
650 | 7 | |a MATHEMATICS |x Graphic Methods. |2 bisacsh | |
650 | 7 | |a Graph algorithms |2 fast | |
650 | 7 | |a Graph theory |2 fast | |
700 | 1 | |a Liotta, Giuseppe. |1 https://id.oclc.org/worldcat/entity/E39PCjxmpD8gwMfYY6TfRDryVC |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 3. |d Singapore ; River Edge, N.J. : World Scientific, 2004 |z 9812389393 |z 9789812389398 |w (OCoLC)57521762 |
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=235673 |3 Volltext |
938 | |a Askews and Holts Library Services |b ASKH |n AH24685279 | ||
938 | |a ProQuest Ebook Central |b EBLB |n EBL1681584 | ||
938 | |a EBSCOhost |b EBSC |n 235673 | ||
938 | |a YBP Library Services |b YANK |n 2895789 | ||
994 | |a 92 |b GEBAY | ||
912 | |a ZDB-4-EBA | ||
049 | |a DE-863 |
Datensatz im Suchindex
DE-BY-FWS_katkey | ZDB-4-EBA-ocn263165317 |
---|---|
_version_ | 1816881679191506944 |
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 .G7 2004eb |
callnumber-search | QA166.245 .G7 2004eb |
callnumber-sort | QA 3166.245 G7 42004EB |
callnumber-subject | QA - Mathematics |
collection | ZDB-4-EBA |
contents | Volume 6:1 (2002). Special issue on graph drawing and representations: selected papers from the 1999 symposium on graph drawing. Guest editors: Hubert de Praysseix and Jan Kratochvil. Guest editors' foreword / Hubert de Fraysseix and Jan Kratochvil. Triangle-free planar graphs and segment intersection graphs / Natalia de Castro [and others]. Communicated by Hubert de Fraysseix and Jan Kratochvil. Planar graphs with topological constraints / Christoph Dornheim. Communicated by Hubert de Fraysseix and Jan Kratochvil. Level planar embedding in linear time / Michael Jünger and Sebastian Leipert. Communicated by Hubert de Fraysseix and Jan Kratochvil. Embedding vertices at points: few bends suffice for planar graphs / Michael Kaufmann and Roland Wiese. Communicated by Hubert de Fraysseix and Jan Kratochvil. Art of graph drawing and art / Jaroslav Nešetřil. Communicated by Hubert de Fraysseix and Jan Kratochvil. Realization of Posets / Patrice Ossona de Mendez. Communicated by Hubert de Fraysseix and Jan Kratochvil -- Volume 6:2 (2002). Traversing directed Eulerian mazes / S. Bhatt [and others]. Communicated by Samir Khuller -- Volume 6:3 (2002). Special issue on selected papers from the 2000 symposium on graph drawing. Guest editors: Michael Kaufmann. Guest editor's foreword / Michael Kaufmann. A fast multi-scale method for drawing large graphs / David Harel and Yehuda Koren. Communicated by Michael Kaufmann. GRIP: graph drawing with intelligent placement / Pawel Gajer and Stephen G. Kobourov. Communicated by Michael Kaufmann. A user study in similarity measures for graph drawing / Stina Bridgeman and Roberto Tamassia. Communicated by Michael Kaufmann. Graph layout aesthetics in UML diagrams: user preferences / Helen C. Purchase, Jo-Anne Allder and David Carrington. Communicated by Michael Kaufmann. Visualization of the high level structure of the internet with Hermes / Andrea Carmignani [and others]. Communicated by Michael Kaufmann. A framework for the static and interactive visualization of statecharts / Rodolfo Castelló, Rym Mili and Ioannis G. Tollis. Communicated by Michael Kaufmann. Graph drawing in motion / Carsten Friedrich and Peter Eades. Communicated by Michael Kaufmann -- Volume 6:4 (2002). A 6-regular Torus graph family with applications to cellular and interconnection networks / Mihaela Iridon and David W. Matula. Communicated by Balaji Raghavachari. |
ctrlnum | (OCoLC)263165317 |
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>06328cam a2200613 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn263165317</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">081023s2004 si a ob 000 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">EBLCP</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NLGGC</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COCUF</subfield><subfield code="d">ZCU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">MERUC</subfield><subfield code="d">U3W</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">AGLDB</subfield><subfield code="d">ICG</subfield><subfield code="d">INT</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">STF</subfield><subfield code="d">DKC</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">LEAUB</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SXB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">815755877</subfield><subfield code="a">1086526519</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789812796608</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9812796606</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">128195599X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781281955999</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9812389393</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9789812389398</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)263165317</subfield><subfield code="z">(OCoLC)815755877</subfield><subfield code="z">(OCoLC)1086526519</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA166.245</subfield><subfield code="b">.G7 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 3 /</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 three</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Singapore ;</subfield><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 (x, 404 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="500" ind1=" " ind2=" "><subfield code="a">"This book contains volume 6 of the Journal of graph algorithms and applications (JGAA)"--Preface</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 Volume 6 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 networks, user interfaces and visualization, and VLSI circuit design. Graph Algorithms and Applications 3 presents contributions from prominent authors and includes selected papers from the Symposium on Graph Drawing (1999 and 2000). 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 6:1 (2002). Special issue on graph drawing and representations: selected papers from the 1999 symposium on graph drawing. Guest editors: Hubert de Praysseix and Jan Kratochvil. Guest editors' foreword / Hubert de Fraysseix and Jan Kratochvil. Triangle-free planar graphs and segment intersection graphs / Natalia de Castro [and others]. Communicated by Hubert de Fraysseix and Jan Kratochvil. Planar graphs with topological constraints / Christoph Dornheim. Communicated by Hubert de Fraysseix and Jan Kratochvil. Level planar embedding in linear time / Michael Jünger and Sebastian Leipert. Communicated by Hubert de Fraysseix and Jan Kratochvil. Embedding vertices at points: few bends suffice for planar graphs / Michael Kaufmann and Roland Wiese. Communicated by Hubert de Fraysseix and Jan Kratochvil. Art of graph drawing and art / Jaroslav Nešetřil. Communicated by Hubert de Fraysseix and Jan Kratochvil. Realization of Posets / Patrice Ossona de Mendez. Communicated by Hubert de Fraysseix and Jan Kratochvil -- Volume 6:2 (2002). Traversing directed Eulerian mazes / S. Bhatt [and others]. Communicated by Samir Khuller -- Volume 6:3 (2002). Special issue on selected papers from the 2000 symposium on graph drawing. Guest editors: Michael Kaufmann. Guest editor's foreword / Michael Kaufmann. A fast multi-scale method for drawing large graphs / David Harel and Yehuda Koren. Communicated by Michael Kaufmann. GRIP: graph drawing with intelligent placement / Pawel Gajer and Stephen G. Kobourov. Communicated by Michael Kaufmann. A user study in similarity measures for graph drawing / Stina Bridgeman and Roberto Tamassia. Communicated by Michael Kaufmann. Graph layout aesthetics in UML diagrams: user preferences / Helen C. Purchase, Jo-Anne Allder and David Carrington. Communicated by Michael Kaufmann. Visualization of the high level structure of the internet with Hermes / Andrea Carmignani [and others]. Communicated by Michael Kaufmann. A framework for the static and interactive visualization of statecharts / Rodolfo Castelló, Rym Mili and Ioannis G. Tollis. Communicated by Michael Kaufmann. Graph drawing in motion / Carsten Friedrich and Peter Eades. Communicated by Michael Kaufmann -- Volume 6:4 (2002). A 6-regular Torus graph family with applications to cellular and interconnection networks / Mihaela Iridon and David W. Matula. Communicated by Balaji Raghavachari.</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">Graph theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85056471</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes de graphes.</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">Graph theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liotta, Giuseppe.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjxmpD8gwMfYY6TfRDryVC</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 3.</subfield><subfield code="d">Singapore ; River Edge, N.J. : World Scientific, 2004</subfield><subfield code="z">9812389393</subfield><subfield code="z">9789812389398</subfield><subfield code="w">(OCoLC)57521762</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=235673</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">AH24685279</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL1681584</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">235673</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2895789</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-ocn263165317 |
illustrated | Illustrated |
indexdate | 2024-11-27T13:16:33Z |
institution | BVB |
isbn | 9789812796608 9812796606 128195599X 9781281955999 |
language | English |
oclc_num | 263165317 |
open_access_boolean | |
owner | MAIN DE-863 DE-BY-FWS |
owner_facet | MAIN DE-863 DE-BY-FWS |
physical | 1 online resource (x, 404 pages) : illustrations |
psigel | ZDB-4-EBA |
publishDate | 2004 |
publishDateSearch | 2004 |
publishDateSort | 2004 |
publisher | World Scientific, |
record_format | marc |
spelling | Graph algorithms and applications 3 / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis. Graph algorithms and applications three Singapore ; River Edge, N.J. : World Scientific, 2004. 1 online resource (x, 404 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier "This book contains volume 6 of the Journal of graph algorithms and applications (JGAA)"--Preface Includes bibliographical references. Print version record. This book contains Volume 6 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 networks, user interfaces and visualization, and VLSI circuit design. Graph Algorithms and Applications 3 presents contributions from prominent authors and includes selected papers from the Symposium on Graph Drawing (1999 and 2000). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications. Volume 6:1 (2002). Special issue on graph drawing and representations: selected papers from the 1999 symposium on graph drawing. Guest editors: Hubert de Praysseix and Jan Kratochvil. Guest editors' foreword / Hubert de Fraysseix and Jan Kratochvil. Triangle-free planar graphs and segment intersection graphs / Natalia de Castro [and others]. Communicated by Hubert de Fraysseix and Jan Kratochvil. Planar graphs with topological constraints / Christoph Dornheim. Communicated by Hubert de Fraysseix and Jan Kratochvil. Level planar embedding in linear time / Michael Jünger and Sebastian Leipert. Communicated by Hubert de Fraysseix and Jan Kratochvil. Embedding vertices at points: few bends suffice for planar graphs / Michael Kaufmann and Roland Wiese. Communicated by Hubert de Fraysseix and Jan Kratochvil. Art of graph drawing and art / Jaroslav Nešetřil. Communicated by Hubert de Fraysseix and Jan Kratochvil. Realization of Posets / Patrice Ossona de Mendez. Communicated by Hubert de Fraysseix and Jan Kratochvil -- Volume 6:2 (2002). Traversing directed Eulerian mazes / S. Bhatt [and others]. Communicated by Samir Khuller -- Volume 6:3 (2002). Special issue on selected papers from the 2000 symposium on graph drawing. Guest editors: Michael Kaufmann. Guest editor's foreword / Michael Kaufmann. A fast multi-scale method for drawing large graphs / David Harel and Yehuda Koren. Communicated by Michael Kaufmann. GRIP: graph drawing with intelligent placement / Pawel Gajer and Stephen G. Kobourov. Communicated by Michael Kaufmann. A user study in similarity measures for graph drawing / Stina Bridgeman and Roberto Tamassia. Communicated by Michael Kaufmann. Graph layout aesthetics in UML diagrams: user preferences / Helen C. Purchase, Jo-Anne Allder and David Carrington. Communicated by Michael Kaufmann. Visualization of the high level structure of the internet with Hermes / Andrea Carmignani [and others]. Communicated by Michael Kaufmann. A framework for the static and interactive visualization of statecharts / Rodolfo Castelló, Rym Mili and Ioannis G. Tollis. Communicated by Michael Kaufmann. Graph drawing in motion / Carsten Friedrich and Peter Eades. Communicated by Michael Kaufmann -- Volume 6:4 (2002). A 6-regular Torus graph family with applications to cellular and interconnection networks / Mihaela Iridon and David W. Matula. Communicated by Balaji Raghavachari. Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Algorithmes de graphes. MATHEMATICS Graphic Methods. bisacsh Graph algorithms fast Graph theory fast Liotta, Giuseppe. https://id.oclc.org/worldcat/entity/E39PCjxmpD8gwMfYY6TfRDryVC 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 3. Singapore ; River Edge, N.J. : World Scientific, 2004 9812389393 9789812389398 (OCoLC)57521762 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235673 Volltext |
spellingShingle | Graph algorithms and applications 3 / Volume 6:1 (2002). Special issue on graph drawing and representations: selected papers from the 1999 symposium on graph drawing. Guest editors: Hubert de Praysseix and Jan Kratochvil. Guest editors' foreword / Hubert de Fraysseix and Jan Kratochvil. Triangle-free planar graphs and segment intersection graphs / Natalia de Castro [and others]. Communicated by Hubert de Fraysseix and Jan Kratochvil. Planar graphs with topological constraints / Christoph Dornheim. Communicated by Hubert de Fraysseix and Jan Kratochvil. Level planar embedding in linear time / Michael Jünger and Sebastian Leipert. Communicated by Hubert de Fraysseix and Jan Kratochvil. Embedding vertices at points: few bends suffice for planar graphs / Michael Kaufmann and Roland Wiese. Communicated by Hubert de Fraysseix and Jan Kratochvil. Art of graph drawing and art / Jaroslav Nešetřil. Communicated by Hubert de Fraysseix and Jan Kratochvil. Realization of Posets / Patrice Ossona de Mendez. Communicated by Hubert de Fraysseix and Jan Kratochvil -- Volume 6:2 (2002). Traversing directed Eulerian mazes / S. Bhatt [and others]. Communicated by Samir Khuller -- Volume 6:3 (2002). Special issue on selected papers from the 2000 symposium on graph drawing. Guest editors: Michael Kaufmann. Guest editor's foreword / Michael Kaufmann. A fast multi-scale method for drawing large graphs / David Harel and Yehuda Koren. Communicated by Michael Kaufmann. GRIP: graph drawing with intelligent placement / Pawel Gajer and Stephen G. Kobourov. Communicated by Michael Kaufmann. A user study in similarity measures for graph drawing / Stina Bridgeman and Roberto Tamassia. Communicated by Michael Kaufmann. Graph layout aesthetics in UML diagrams: user preferences / Helen C. Purchase, Jo-Anne Allder and David Carrington. Communicated by Michael Kaufmann. Visualization of the high level structure of the internet with Hermes / Andrea Carmignani [and others]. Communicated by Michael Kaufmann. A framework for the static and interactive visualization of statecharts / Rodolfo Castelló, Rym Mili and Ioannis G. Tollis. Communicated by Michael Kaufmann. Graph drawing in motion / Carsten Friedrich and Peter Eades. Communicated by Michael Kaufmann -- Volume 6:4 (2002). A 6-regular Torus graph family with applications to cellular and interconnection networks / Mihaela Iridon and David W. Matula. Communicated by Balaji Raghavachari. Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Algorithmes de graphes. MATHEMATICS Graphic Methods. bisacsh Graph algorithms fast Graph theory fast |
subject_GND | http://id.loc.gov/authorities/subjects/sh2002004605 http://id.loc.gov/authorities/subjects/sh85056471 |
title | Graph algorithms and applications 3 / |
title_alt | Graph algorithms and applications three Journal of graph algorithms and applications. |
title_auth | Graph algorithms and applications 3 / |
title_exact_search | Graph algorithms and applications 3 / |
title_full | Graph algorithms and applications 3 / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis. |
title_fullStr | Graph algorithms and applications 3 / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis. |
title_full_unstemmed | Graph algorithms and applications 3 / Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis. |
title_short | Graph algorithms and applications 3 / |
title_sort | graph algorithms and applications 3 |
topic | Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Algorithmes de graphes. MATHEMATICS Graphic Methods. bisacsh Graph algorithms fast Graph theory fast |
topic_facet | Graph algorithms. Graph theory. Algorithmes de graphes. MATHEMATICS Graphic Methods. Graph algorithms Graph theory |
url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=235673 |
work_keys_str_mv | UT journalofgraphalgorithmsandapplications AT liottagiuseppe graphalgorithmsandapplications3 AT tamassiaroberto graphalgorithmsandapplications3 AT tollisioannisg graphalgorithmsandapplications3 AT liottagiuseppe graphalgorithmsandapplicationsthree AT tamassiaroberto graphalgorithmsandapplicationsthree AT tollisioannisg graphalgorithmsandapplicationsthree |