Graph algorithms and applications 4 /:
Annotation This book contains Volume 7 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 in...
Gespeichert in:
| Weitere Verfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Singapore ; Hackensack, N.J. :
World Scientific,
©2006.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Annotation This book contains Volume 7 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. |
| Beschreibung: | "This book contains volume 7 of the Journal of Graph Algorithms and Applications (JGAA)"--Preface. |
| Beschreibung: | 1 online resource (x, 427 pages) : illustrations |
| Bibliographie: | Includes bibliographical references. |
| ISBN: | 9812773290 9789812773296 |
Internformat
MARC
| LEADER | 00000cam a2200000Ma 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn560451246 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 061012s2006 si a ob 000 0 eng d | ||
| 040 | |a MERUC |b eng |e pn |c MERUC |d CCO |d E7B |d OCLCQ |d COCUF |d N$T |d YDXCP |d IDEBK |d OCLCQ |d OCLCF |d DKDLA |d OCLCQ |d MHW |d EBLCP |d DEBSZ |d OCLCQ |d AGLDB |d MOR |d PIFAG |d ZCU |d MERUC |d OCLCQ |d U3W |d STF |d WRM |d OCLCQ |d VTS |d NRAMU |d ICG |d INT |d VT2 |d AU@ |d OCLCQ |d JBG |d WYU |d OCLCQ |d DKC |d OCLCQ |d M8D |d UKAHL |d OCLCQ |d K6U |d LEAUB |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
| 019 | |a 181645972 |a 305129621 |a 647684464 |a 879025503 |a 988503587 |a 991999814 |a 1037790063 |a 1038655600 |a 1045439995 |a 1055374176 |a 1081270211 |a 1086490635 |a 1148081835 | ||
| 020 | |a 9812773290 |q (electronic bk.) | ||
| 020 | |a 9789812773296 |q (electronic bk.) | ||
| 020 | |z 9789812568441 | ||
| 020 | |z 9789812773296 | ||
| 020 | |z 9812568441 | ||
| 035 | |a (OCoLC)560451246 |z (OCoLC)181645972 |z (OCoLC)305129621 |z (OCoLC)647684464 |z (OCoLC)879025503 |z (OCoLC)988503587 |z (OCoLC)991999814 |z (OCoLC)1037790063 |z (OCoLC)1038655600 |z (OCoLC)1045439995 |z (OCoLC)1055374176 |z (OCoLC)1081270211 |z (OCoLC)1086490635 |z (OCoLC)1148081835 | ||
| 050 | 4 | |a QA166.245 |b .G72 2006eb | |
| 072 | 7 | |a MAT |x 013000 |2 bisacsh | |
| 082 | 7 | |a 511/.5 |2 22 | |
| 049 | |a MAIN | ||
| 245 | 0 | 0 | |a Graph algorithms and applications 4 / |c editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis. |
| 246 | 3 | |a Graph algorithms and applications four | |
| 246 | 3 | |a Graph algorithms & applications 4 | |
| 260 | |a Singapore ; |a Hackensack, N.J. : |b World Scientific, |c ©2006. | ||
| 300 | |a 1 online resource (x, 427 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 7 of the Journal of Graph Algorithms and Applications (JGAA)"--Preface. | ||
| 504 | |a Includes bibliographical references. | ||
| 588 | 0 | |a Print version record. | |
| 520 | 8 | |a Annotation This book contains Volume 7 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. | |
| 505 | 0 | |a Volume 7:1 (2003). Statistical analysis of algorithms: a case study of market-clearing mechanisms in the power industry / Chris Barrett [and others], communicated by Dorothea Wagner. Lower bounds for the number of bends in three-dimensional orthogonal graph drawings / David R. Wood, communicated by Dorothea Wagner. Hamilton decompositions and (n/2)-factorizations of hypercubes / Douglas W. Bass and I. Hal Sudborough, communicated by Balaji Raghavachari -- volume 7:2 (2003). Special issue on selected papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001 / Guest editor(s): Giuseppe Liotta and Ioannis G. Tollis. Guest editors' foreword / Giuseppe Liotta and Ioannis G. Tollis. On external-memory planar depth first search / Lars Arge [and others]. Small maximal independent sets and faster exact graph coloring / David Eppstein, communicated by Giuseppe Liotta and Ioannis G. Tollis. Deciding clique-width for graphs of bounded tree-width / Wolfgang Espelage, Frank Gurski and Egon Wanke, communicated by Giuseppe Liotta and Ioannis G. Tollis. Visual ranking of link structures / Ulrik Brandes and Sabine Cornelsen, communicated by Giuseppe Liotta and Ioannis G. Tollis. An approach for mixed upward planarization / Markus Eiglsperger, Michael Kaufmann and Frank Eppinger, communicated by Giuseppe Liotta and Ioannis G. Tollis. Upward embeddings and orientations of undirected planar graphs / Walter Didimo and Maurizio Pizzonia, communicated by Giuseppe Liotta and Ioannis G. Tollis -- volume 7:3 (2003). Crossing numbers and cutwidths / Hristo N. Djidjev and Imrich Vrto, communicated by Giuseppe Liotta. A multilevel algorithm for force-directed graph-drawing / Chris Walshaw, communicated by Michael Kaufmann. Finding shortest paths with computational geometry / Po-Shen Loh, communicated by Joseph S.B. Mitchell -- volume 7:4 (2003). Advances in graph drawing. Special issue on selected papers from the Ninth International Symposium on Graph Drawing, GD 2001 / Guest editor(s): Petra Mutzel and Michael Junger. Guest editor's foreward / Petra Mutzel and Michael Junger. Polar coordinate drawing of planar graphs with good angular resolution / Christian Duncan and Stephen Kobourov, communicated by Petra Mutzel and Michael Jünger. Orthogonal drawings of plane graphs without bends / Md. Saidur Rahman, Takao Nizhizeki and Mahmuda Naznin, communicated by Petra Mutzel and Michael J̈nger. Straight-line drawings on restricted integer grids in two and three dimensions / Stefan Felsner, Giuseppe Liotta and Stephen Wismath, communicated by Petra Mutzel and Michael Jünger. Low-distortion embeddings of trees / Robert Babilon, Jiří Matoušek, Jana Maxová and Pavel Valtr, communicated by Petra Mutzel and Michael Jünger. On Cotree-critical and DFS Cotree-critical graphs / Hubert de Frayseix and Patrice Ossona de Mendez, communicated by Petra Mutzel and Michael Jünger. | |
| 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. |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 4. |d Singapore ; Hackensack, N.J. : World Scientific, ©2006 |z 9812568441 |z 9789812568441 |w (OCoLC)72763182 |
| 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=210576 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH24684424 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL1681585 | ||
| 938 | |a ebrary |b EBRY |n ebr10201365 | ||
| 938 | |a EBSCOhost |b EBSC |n 210576 | ||
| 938 | |a YBP Library Services |b YANK |n 2736096 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn560451246 |
|---|---|
| _version_ | 1816881707816583169 |
| 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 .G72 2006eb |
| callnumber-search | QA166.245 .G72 2006eb |
| callnumber-sort | QA 3166.245 G72 42006EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Volume 7:1 (2003). Statistical analysis of algorithms: a case study of market-clearing mechanisms in the power industry / Chris Barrett [and others], communicated by Dorothea Wagner. Lower bounds for the number of bends in three-dimensional orthogonal graph drawings / David R. Wood, communicated by Dorothea Wagner. Hamilton decompositions and (n/2)-factorizations of hypercubes / Douglas W. Bass and I. Hal Sudborough, communicated by Balaji Raghavachari -- volume 7:2 (2003). Special issue on selected papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001 / Guest editor(s): Giuseppe Liotta and Ioannis G. Tollis. Guest editors' foreword / Giuseppe Liotta and Ioannis G. Tollis. On external-memory planar depth first search / Lars Arge [and others]. Small maximal independent sets and faster exact graph coloring / David Eppstein, communicated by Giuseppe Liotta and Ioannis G. Tollis. Deciding clique-width for graphs of bounded tree-width / Wolfgang Espelage, Frank Gurski and Egon Wanke, communicated by Giuseppe Liotta and Ioannis G. Tollis. Visual ranking of link structures / Ulrik Brandes and Sabine Cornelsen, communicated by Giuseppe Liotta and Ioannis G. Tollis. An approach for mixed upward planarization / Markus Eiglsperger, Michael Kaufmann and Frank Eppinger, communicated by Giuseppe Liotta and Ioannis G. Tollis. Upward embeddings and orientations of undirected planar graphs / Walter Didimo and Maurizio Pizzonia, communicated by Giuseppe Liotta and Ioannis G. Tollis -- volume 7:3 (2003). Crossing numbers and cutwidths / Hristo N. Djidjev and Imrich Vrto, communicated by Giuseppe Liotta. A multilevel algorithm for force-directed graph-drawing / Chris Walshaw, communicated by Michael Kaufmann. Finding shortest paths with computational geometry / Po-Shen Loh, communicated by Joseph S.B. Mitchell -- volume 7:4 (2003). Advances in graph drawing. Special issue on selected papers from the Ninth International Symposium on Graph Drawing, GD 2001 / Guest editor(s): Petra Mutzel and Michael Junger. Guest editor's foreward / Petra Mutzel and Michael Junger. Polar coordinate drawing of planar graphs with good angular resolution / Christian Duncan and Stephen Kobourov, communicated by Petra Mutzel and Michael Jünger. Orthogonal drawings of plane graphs without bends / Md. Saidur Rahman, Takao Nizhizeki and Mahmuda Naznin, communicated by Petra Mutzel and Michael J̈nger. Straight-line drawings on restricted integer grids in two and three dimensions / Stefan Felsner, Giuseppe Liotta and Stephen Wismath, communicated by Petra Mutzel and Michael Jünger. Low-distortion embeddings of trees / Robert Babilon, Jiří Matoušek, Jana Maxová and Pavel Valtr, communicated by Petra Mutzel and Michael Jünger. On Cotree-critical and DFS Cotree-critical graphs / Hubert de Frayseix and Patrice Ossona de Mendez, communicated by Petra Mutzel and Michael Jünger. |
| ctrlnum | (OCoLC)560451246 |
| 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 15 |
| 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>06928cam a2200613Ma 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn560451246</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">061012s2006 si a ob 000 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MERUC</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">MERUC</subfield><subfield code="d">CCO</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COCUF</subfield><subfield code="d">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">DKDLA</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">MHW</subfield><subfield code="d">EBLCP</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AGLDB</subfield><subfield code="d">MOR</subfield><subfield code="d">PIFAG</subfield><subfield code="d">ZCU</subfield><subfield code="d">MERUC</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">ICG</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">JBG</subfield><subfield code="d">WYU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DKC</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></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">181645972</subfield><subfield code="a">305129621</subfield><subfield code="a">647684464</subfield><subfield code="a">879025503</subfield><subfield code="a">988503587</subfield><subfield code="a">991999814</subfield><subfield code="a">1037790063</subfield><subfield code="a">1038655600</subfield><subfield code="a">1045439995</subfield><subfield code="a">1055374176</subfield><subfield code="a">1081270211</subfield><subfield code="a">1086490635</subfield><subfield code="a">1148081835</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9812773290</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789812773296</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9789812568441</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9789812773296</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9812568441</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)560451246</subfield><subfield code="z">(OCoLC)181645972</subfield><subfield code="z">(OCoLC)305129621</subfield><subfield code="z">(OCoLC)647684464</subfield><subfield code="z">(OCoLC)879025503</subfield><subfield code="z">(OCoLC)988503587</subfield><subfield code="z">(OCoLC)991999814</subfield><subfield code="z">(OCoLC)1037790063</subfield><subfield code="z">(OCoLC)1038655600</subfield><subfield code="z">(OCoLC)1045439995</subfield><subfield code="z">(OCoLC)1055374176</subfield><subfield code="z">(OCoLC)1081270211</subfield><subfield code="z">(OCoLC)1086490635</subfield><subfield code="z">(OCoLC)1148081835</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA166.245</subfield><subfield code="b">.G72 2006eb</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="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 4 /</subfield><subfield code="c">editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis.</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">Graph algorithms and applications four</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">Graph algorithms & applications 4</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Singapore ;</subfield><subfield code="a">Hackensack, N.J. :</subfield><subfield code="b">World Scientific,</subfield><subfield code="c">©2006.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 427 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 7 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="8" ind2=" "><subfield code="a">Annotation This book contains Volume 7 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.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Volume 7:1 (2003). Statistical analysis of algorithms: a case study of market-clearing mechanisms in the power industry / Chris Barrett [and others], communicated by Dorothea Wagner. Lower bounds for the number of bends in three-dimensional orthogonal graph drawings / David R. Wood, communicated by Dorothea Wagner. Hamilton decompositions and (n/2)-factorizations of hypercubes / Douglas W. Bass and I. Hal Sudborough, communicated by Balaji Raghavachari -- volume 7:2 (2003). Special issue on selected papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001 / Guest editor(s): Giuseppe Liotta and Ioannis G. Tollis. Guest editors' foreword / Giuseppe Liotta and Ioannis G. Tollis. On external-memory planar depth first search / Lars Arge [and others]. Small maximal independent sets and faster exact graph coloring / David Eppstein, communicated by Giuseppe Liotta and Ioannis G. Tollis. Deciding clique-width for graphs of bounded tree-width / Wolfgang Espelage, Frank Gurski and Egon Wanke, communicated by Giuseppe Liotta and Ioannis G. Tollis. Visual ranking of link structures / Ulrik Brandes and Sabine Cornelsen, communicated by Giuseppe Liotta and Ioannis G. Tollis. An approach for mixed upward planarization / Markus Eiglsperger, Michael Kaufmann and Frank Eppinger, communicated by Giuseppe Liotta and Ioannis G. Tollis. Upward embeddings and orientations of undirected planar graphs / Walter Didimo and Maurizio Pizzonia, communicated by Giuseppe Liotta and Ioannis G. Tollis -- volume 7:3 (2003). Crossing numbers and cutwidths / Hristo N. Djidjev and Imrich Vrto, communicated by Giuseppe Liotta. A multilevel algorithm for force-directed graph-drawing / Chris Walshaw, communicated by Michael Kaufmann. Finding shortest paths with computational geometry / Po-Shen Loh, communicated by Joseph S.B. Mitchell -- volume 7:4 (2003). Advances in graph drawing. Special issue on selected papers from the Ninth International Symposium on Graph Drawing, GD 2001 / Guest editor(s): Petra Mutzel and Michael Junger. Guest editor's foreward / Petra Mutzel and Michael Junger. Polar coordinate drawing of planar graphs with good angular resolution / Christian Duncan and Stephen Kobourov, communicated by Petra Mutzel and Michael Jünger. Orthogonal drawings of plane graphs without bends / Md. Saidur Rahman, Takao Nizhizeki and Mahmuda Naznin, communicated by Petra Mutzel and Michael J̈nger. Straight-line drawings on restricted integer grids in two and three dimensions / Stefan Felsner, Giuseppe Liotta and Stephen Wismath, communicated by Petra Mutzel and Michael Jünger. Low-distortion embeddings of trees / Robert Babilon, Jiří Matoušek, Jana Maxová and Pavel Valtr, communicated by Petra Mutzel and Michael Jünger. On Cotree-critical and DFS Cotree-critical graphs / Hubert de Frayseix and Patrice Ossona de Mendez, communicated by Petra Mutzel and Michael Jünger.</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="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 4.</subfield><subfield code="d">Singapore ; Hackensack, N.J. : World Scientific, ©2006</subfield><subfield code="z">9812568441</subfield><subfield code="z">9789812568441</subfield><subfield code="w">(OCoLC)72763182</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=210576</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">AH24684424</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL1681585</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10201365</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">210576</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2736096</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-ocn560451246 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:17:00Z |
| institution | BVB |
| isbn | 9812773290 9789812773296 |
| language | English |
| oclc_num | 560451246 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (x, 427 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | World Scientific, |
| record_format | marc |
| spelling | Graph algorithms and applications 4 / editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis. Graph algorithms and applications four Graph algorithms & applications 4 Singapore ; Hackensack, N.J. : World Scientific, ©2006. 1 online resource (x, 427 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier "This book contains volume 7 of the Journal of Graph Algorithms and Applications (JGAA)"--Preface. Includes bibliographical references. Print version record. Annotation This book contains Volume 7 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. Volume 7:1 (2003). Statistical analysis of algorithms: a case study of market-clearing mechanisms in the power industry / Chris Barrett [and others], communicated by Dorothea Wagner. Lower bounds for the number of bends in three-dimensional orthogonal graph drawings / David R. Wood, communicated by Dorothea Wagner. Hamilton decompositions and (n/2)-factorizations of hypercubes / Douglas W. Bass and I. Hal Sudborough, communicated by Balaji Raghavachari -- volume 7:2 (2003). Special issue on selected papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001 / Guest editor(s): Giuseppe Liotta and Ioannis G. Tollis. Guest editors' foreword / Giuseppe Liotta and Ioannis G. Tollis. On external-memory planar depth first search / Lars Arge [and others]. Small maximal independent sets and faster exact graph coloring / David Eppstein, communicated by Giuseppe Liotta and Ioannis G. Tollis. Deciding clique-width for graphs of bounded tree-width / Wolfgang Espelage, Frank Gurski and Egon Wanke, communicated by Giuseppe Liotta and Ioannis G. Tollis. Visual ranking of link structures / Ulrik Brandes and Sabine Cornelsen, communicated by Giuseppe Liotta and Ioannis G. Tollis. An approach for mixed upward planarization / Markus Eiglsperger, Michael Kaufmann and Frank Eppinger, communicated by Giuseppe Liotta and Ioannis G. Tollis. Upward embeddings and orientations of undirected planar graphs / Walter Didimo and Maurizio Pizzonia, communicated by Giuseppe Liotta and Ioannis G. Tollis -- volume 7:3 (2003). Crossing numbers and cutwidths / Hristo N. Djidjev and Imrich Vrto, communicated by Giuseppe Liotta. A multilevel algorithm for force-directed graph-drawing / Chris Walshaw, communicated by Michael Kaufmann. Finding shortest paths with computational geometry / Po-Shen Loh, communicated by Joseph S.B. Mitchell -- volume 7:4 (2003). Advances in graph drawing. Special issue on selected papers from the Ninth International Symposium on Graph Drawing, GD 2001 / Guest editor(s): Petra Mutzel and Michael Junger. Guest editor's foreward / Petra Mutzel and Michael Junger. Polar coordinate drawing of planar graphs with good angular resolution / Christian Duncan and Stephen Kobourov, communicated by Petra Mutzel and Michael Jünger. Orthogonal drawings of plane graphs without bends / Md. Saidur Rahman, Takao Nizhizeki and Mahmuda Naznin, communicated by Petra Mutzel and Michael J̈nger. Straight-line drawings on restricted integer grids in two and three dimensions / Stefan Felsner, Giuseppe Liotta and Stephen Wismath, communicated by Petra Mutzel and Michael Jünger. Low-distortion embeddings of trees / Robert Babilon, Jiří Matoušek, Jana Maxová and Pavel Valtr, communicated by Petra Mutzel and Michael Jünger. On Cotree-critical and DFS Cotree-critical graphs / Hubert de Frayseix and Patrice Ossona de Mendez, communicated by Petra Mutzel and Michael Jünger. 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. 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 4. Singapore ; Hackensack, N.J. : World Scientific, ©2006 9812568441 9789812568441 (OCoLC)72763182 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=210576 Volltext |
| spellingShingle | Graph algorithms and applications 4 / Volume 7:1 (2003). Statistical analysis of algorithms: a case study of market-clearing mechanisms in the power industry / Chris Barrett [and others], communicated by Dorothea Wagner. Lower bounds for the number of bends in three-dimensional orthogonal graph drawings / David R. Wood, communicated by Dorothea Wagner. Hamilton decompositions and (n/2)-factorizations of hypercubes / Douglas W. Bass and I. Hal Sudborough, communicated by Balaji Raghavachari -- volume 7:2 (2003). Special issue on selected papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001 / Guest editor(s): Giuseppe Liotta and Ioannis G. Tollis. Guest editors' foreword / Giuseppe Liotta and Ioannis G. Tollis. On external-memory planar depth first search / Lars Arge [and others]. Small maximal independent sets and faster exact graph coloring / David Eppstein, communicated by Giuseppe Liotta and Ioannis G. Tollis. Deciding clique-width for graphs of bounded tree-width / Wolfgang Espelage, Frank Gurski and Egon Wanke, communicated by Giuseppe Liotta and Ioannis G. Tollis. Visual ranking of link structures / Ulrik Brandes and Sabine Cornelsen, communicated by Giuseppe Liotta and Ioannis G. Tollis. An approach for mixed upward planarization / Markus Eiglsperger, Michael Kaufmann and Frank Eppinger, communicated by Giuseppe Liotta and Ioannis G. Tollis. Upward embeddings and orientations of undirected planar graphs / Walter Didimo and Maurizio Pizzonia, communicated by Giuseppe Liotta and Ioannis G. Tollis -- volume 7:3 (2003). Crossing numbers and cutwidths / Hristo N. Djidjev and Imrich Vrto, communicated by Giuseppe Liotta. A multilevel algorithm for force-directed graph-drawing / Chris Walshaw, communicated by Michael Kaufmann. Finding shortest paths with computational geometry / Po-Shen Loh, communicated by Joseph S.B. Mitchell -- volume 7:4 (2003). Advances in graph drawing. Special issue on selected papers from the Ninth International Symposium on Graph Drawing, GD 2001 / Guest editor(s): Petra Mutzel and Michael Junger. Guest editor's foreward / Petra Mutzel and Michael Junger. Polar coordinate drawing of planar graphs with good angular resolution / Christian Duncan and Stephen Kobourov, communicated by Petra Mutzel and Michael Jünger. Orthogonal drawings of plane graphs without bends / Md. Saidur Rahman, Takao Nizhizeki and Mahmuda Naznin, communicated by Petra Mutzel and Michael J̈nger. Straight-line drawings on restricted integer grids in two and three dimensions / Stefan Felsner, Giuseppe Liotta and Stephen Wismath, communicated by Petra Mutzel and Michael Jünger. Low-distortion embeddings of trees / Robert Babilon, Jiří Matoušek, Jana Maxová and Pavel Valtr, communicated by Petra Mutzel and Michael Jünger. On Cotree-critical and DFS Cotree-critical graphs / Hubert de Frayseix and Patrice Ossona de Mendez, communicated by Petra Mutzel and Michael Jünger. 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 4 / |
| title_alt | Graph algorithms and applications four Graph algorithms & applications 4 Journal of graph algorithms and applications. |
| title_auth | Graph algorithms and applications 4 / |
| title_exact_search | Graph algorithms and applications 4 / |
| title_full | Graph algorithms and applications 4 / editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis. |
| title_fullStr | Graph algorithms and applications 4 / editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis. |
| title_full_unstemmed | Graph algorithms and applications 4 / editors, Giuseppe Liotta, Roberto Tamassia, Iaonnis G Tollis. |
| title_short | Graph algorithms and applications 4 / |
| title_sort | graph algorithms and applications 4 |
| 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=210576 |
| work_keys_str_mv | UT journalofgraphalgorithmsandapplications AT liottagiuseppe graphalgorithmsandapplications4 AT tamassiaroberto graphalgorithmsandapplications4 AT tollisioannisg graphalgorithmsandapplications4 AT liottagiuseppe graphalgorithmsandapplicationsfour AT tamassiaroberto graphalgorithmsandapplicationsfour AT tollisioannisg graphalgorithmsandapplicationsfour AT liottagiuseppe graphalgorithmsapplications4 AT tamassiaroberto graphalgorithmsapplications4 AT tollisioannisg graphalgorithmsapplications4 |