Gurafu arugorizumu /:
グラフアルゴリズム /
"Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | Japanese English |
| Veröffentlicht: |
Tōkyō :
Kindai Kagakusha,
2021.
|
| Schriftenreihe: | Sedgewick, Robert, 1946- Algorithms in C.
pt. 5. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | "Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years. Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4 , addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment. Coverage includes: A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C code, and detailed algorithm descriptions The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators. A landmark revision, Algorithms in C, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications." -- |
| Beschreibung: | 1 online resource (xiv, 376 pages) |
| Bibliographie: | Includes bibliographical references (pages 369-370) and index. |
| ISBN: | 9784764905665 4764905663 |
Internformat
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-on1306221513 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu|||unuuu | ||
| 008 | 220329s2021 ja ob 001 0 jpn d | ||
| 040 | |a N$T |b eng |e rda |e pn |c N$T |d N$T |d OCLCO |d OCLCF |d OCLCQ |d OCLCO |d OCLCL |d OCLCQ | ||
| 066 | |c $1 |c Hani | ||
| 020 | |a 9784764905665 |q (electronic bk.) | ||
| 020 | |a 4764905663 |q (electronic bk.) | ||
| 035 | |a (OCoLC)1306221513 | ||
| 041 | 1 | |a jpn |h eng | |
| 050 | 4 | |a QA166.245 | |
| 082 | 7 | |a 511.5 |2 23 | |
| 084 | |a 007.64 |2 njb/9 | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Sedgewick, Robert, |d 1946- |e author. |1 https://id.oclc.org/worldcat/entity/E39PBJvd7wrwtkKm8dKM46bfMP |0 http://id.loc.gov/authorities/names/n79041486 | |
| 240 | 1 | 0 | |a Graph algorithms. |l Japanese |
| 245 | 1 | 0 | |6 880-01 |a Gurafu arugorizumu / |c R. Sejiwikku cho ; Taguchi Azuma, Takamatsu Mizuyo, Takazawa Kenjirō kyōyaku = Graph algorithms / Robert Sedgewick. |
| 264 | 1 | |6 880-02 |a Tōkyō : |b Kindai Kagakusha, |c 2021. | |
| 300 | |a 1 online resource (xiv, 376 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |6 880-03 |a Sejiwikku arugorizumu C = |a Algorithms in C ; |v dai 5-bu | |
| 588 | |a Online resource; title from PDF title page (EBSCO, viewed April 7, 2022). | ||
| 504 | |a Includes bibliographical references (pages 369-370) and index. | ||
| 520 | |a "Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years. Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4 , addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment. Coverage includes: A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C code, and detailed algorithm descriptions The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators. A landmark revision, Algorithms in C, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications." -- |c Provided by publishers. | ||
| 650 | 0 | |a Graph algorithms. |0 http://id.loc.gov/authorities/subjects/sh2002004605 | |
| 650 | 0 | |a C (Computer program language) |0 http://id.loc.gov/authorities/subjects/sh85018532 | |
| 650 | 6 | |a Algorithmes de graphes. | |
| 650 | 6 | |a C (Langage de programmation) | |
| 650 | 7 | |a C (Computer program language) |2 fast | |
| 650 | 7 | |a Graph algorithms |2 fast | |
| 650 | 0 | 7 | |6 880-04 |a Arugorizumu. |2 jlabsh/4 |
| 650 | 0 | 7 | |6 880-05 |a Puroguramingu(Konpyūta). |2 jlabsh/4 |
| 700 | 1 | |6 880-06 |a Taguchi, Azuma, |e translator. | |
| 800 | 1 | |a Sedgewick, Robert, |d 1946- |t Algorithms in C. |l Japanese ; |v pt. 5. | |
| 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=3098468 |3 Volltext |
| 880 | 1 | 0 | |6 245-01/$1 |a グラフアルゴリズム / |c R.セジウィック著 ; 田口東, 高松瑞代, 高澤兼二郎共訳 = Graph algorithms / Robert Sedgewick. |
| 880 | 1 | |6 264-02/$1 |a 東京 : |b 近代科学社, |c 2021. | |
| 880 | 1 | |6 490-03/$1 |a セジウィック: アルゴリズムC = |a Algorithms in C ; |v 第 5部 | |
| 880 | |6 520-00/$1 |a "本書は『セジウィック：アルゴリズムC 第1〜4部』に続く，第5部の日本語版．グラフは，現実の問題をコンピュータで計算できるよう離散的な数学モデルに落とし込むための概念であり，本書は，その基礎として外せない項目を網羅している．また、グラフを現実的な時間で解くためのアルゴリズムを豊富に掲載しており，アルゴリズム研究の入門書としてもうってつけである．原著は，『アルゴリズムイントロダクション』と並び称される世界的名著．様々な分野でグラフおよびグラフアルゴリズムの知識が求められている今，待望の翻訳書といえる．"-- |c Provided by publisher. | ||
| 880 | 0 | 7 | |6 650-04/$1 |a アルゴリズム. |2 jlabsh/4 |
| 880 | 0 | 7 | |6 650-05/$1 |a プログラミング(コンピュータ). |2 jlabsh/4 |
| 880 | 1 | |6 700-06/$1 |a 田口東, |e translator. | |
| 880 | |6 758-00/$1 |i has work: |a グラフアルゴリズム (Text) |1 https://id.oclc.org/worldcat/entity/E39PCYrQFCppJ6Q7vxYdFtW6mm |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 938 | |a EBSCOhost |b EBSC |n 3098468 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-on1306221513 |
|---|---|
| _version_ | 1816882558910070785 |
| adam_text | |
| any_adam_object | |
| author | Sedgewick, Robert, 1946- |
| author2 | Taguchi, Azuma |
| author2_role | trl |
| author2_variant | a t at |
| author_GND | http://id.loc.gov/authorities/names/n79041486 |
| author_facet | Sedgewick, Robert, 1946- Taguchi, Azuma |
| author_role | aut |
| author_sort | Sedgewick, Robert, 1946- |
| author_variant | r s rs |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166.245 |
| callnumber-search | QA166.245 |
| callnumber-sort | QA 3166.245 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| ctrlnum | (OCoLC)1306221513 |
| 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>05476cam a2200613 i 4500</leader><controlfield tag="001">ZDB-4-EBA-on1306221513</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">220329s2021 ja ob 001 0 jpn d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">N$T</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="066" ind1=" " ind2=" "><subfield code="c">$1</subfield><subfield code="c">Hani</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9784764905665</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">4764905663</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1306221513</subfield></datafield><datafield tag="041" ind1="1" ind2=" "><subfield code="a">jpn</subfield><subfield code="h">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA166.245</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">007.64</subfield><subfield code="2">njb/9</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sedgewick, Robert,</subfield><subfield code="d">1946-</subfield><subfield code="e">author.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJvd7wrwtkKm8dKM46bfMP</subfield><subfield code="0">http://id.loc.gov/authorities/names/n79041486</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Graph algorithms.</subfield><subfield code="l">Japanese</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="6">880-01</subfield><subfield code="a">Gurafu arugorizumu /</subfield><subfield code="c">R. Sejiwikku cho ; Taguchi Azuma, Takamatsu Mizuyo, Takazawa Kenjirō kyōyaku = Graph algorithms / Robert Sedgewick.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="6">880-02</subfield><subfield code="a">Tōkyō :</subfield><subfield code="b">Kindai Kagakusha,</subfield><subfield code="c">2021.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiv, 376 pages)</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="490" ind1="1" ind2=" "><subfield code="6">880-03</subfield><subfield code="a">Sejiwikku arugorizumu C =</subfield><subfield code="a">Algorithms in C ;</subfield><subfield code="v">dai 5-bu</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Online resource; title from PDF title page (EBSCO, viewed April 7, 2022).</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 369-370) and index.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years. Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4 , addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment. Coverage includes: A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C code, and detailed algorithm descriptions The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators. A landmark revision, Algorithms in C, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications." --</subfield><subfield code="c">Provided by publishers.</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">C (Computer program language)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85018532</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">C (Langage de programmation)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">C (Computer program language)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="6">880-04</subfield><subfield code="a">Arugorizumu.</subfield><subfield code="2">jlabsh/4</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="6">880-05</subfield><subfield code="a">Puroguramingu(Konpyūta).</subfield><subfield code="2">jlabsh/4</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="6">880-06</subfield><subfield code="a">Taguchi, Azuma,</subfield><subfield code="e">translator.</subfield></datafield><datafield tag="800" ind1="1" ind2=" "><subfield code="a">Sedgewick, Robert,</subfield><subfield code="d">1946-</subfield><subfield code="t">Algorithms in C.</subfield><subfield code="l">Japanese ;</subfield><subfield code="v">pt. 5.</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=3098468</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="880" ind1="1" ind2="0"><subfield code="6">245-01/$1</subfield><subfield code="a">グラフアルゴリズム /</subfield><subfield code="c">R.セジウィック著 ; 田口東, 高松瑞代, 高澤兼二郎共訳 = Graph algorithms / Robert Sedgewick.</subfield></datafield><datafield tag="880" ind1=" " ind2="1"><subfield code="6">264-02/$1</subfield><subfield code="a">東京 :</subfield><subfield code="b">近代科学社,</subfield><subfield code="c">2021.</subfield></datafield><datafield tag="880" ind1="1" ind2=" "><subfield code="6">490-03/$1</subfield><subfield code="a">セジウィック: アルゴリズムC =</subfield><subfield code="a">Algorithms in C ;</subfield><subfield code="v">第 5部</subfield></datafield><datafield tag="880" ind1=" " ind2=" "><subfield code="6">520-00/$1</subfield><subfield code="a">"本書は『セジウィック：アルゴリズムC 第1〜4部』に続く，第5部の日本語版．グラフは，現実の問題をコンピュータで計算できるよう離散的な数学モデルに落とし込むための概念であり，本書は，その基礎として外せない項目を網羅している．また、グラフを現実的な時間で解くためのアルゴリズムを豊富に掲載しており，アルゴリズム研究の入門書としてもうってつけである．原著は，『アルゴリズムイントロダクション』と並び称される世界的名著．様々な分野でグラフおよびグラフアルゴリズムの知識が求められている今，待望の翻訳書といえる．"--</subfield><subfield code="c">Provided by publisher.</subfield></datafield><datafield tag="880" ind1="0" ind2="7"><subfield code="6">650-04/$1</subfield><subfield code="a">アルゴリズム.</subfield><subfield code="2">jlabsh/4</subfield></datafield><datafield tag="880" ind1="0" ind2="7"><subfield code="6">650-05/$1</subfield><subfield code="a">プログラミング(コンピュータ).</subfield><subfield code="2">jlabsh/4</subfield></datafield><datafield tag="880" ind1="1" ind2=" "><subfield code="6">700-06/$1</subfield><subfield code="a">田口東,</subfield><subfield code="e">translator.</subfield></datafield><datafield tag="880" ind1=" " ind2=" "><subfield code="6">758-00/$1</subfield><subfield code="i">has work:</subfield><subfield code="a">グラフアルゴリズム (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCYrQFCppJ6Q7vxYdFtW6mm</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">3098468</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-on1306221513 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:30:32Z |
| institution | BVB |
| isbn | 9784764905665 4764905663 |
| language | Japanese English |
| oclc_num | 1306221513 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xiv, 376 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 2021 |
| publishDateSearch | 2021 |
| publishDateSort | 2021 |
| publisher | Kindai Kagakusha, |
| record_format | marc |
| series | Sedgewick, Robert, 1946- Algorithms in C. |
| series2 | Sejiwikku arugorizumu C = Algorithms in C ; |
| spelling | Sedgewick, Robert, 1946- author. https://id.oclc.org/worldcat/entity/E39PBJvd7wrwtkKm8dKM46bfMP http://id.loc.gov/authorities/names/n79041486 Graph algorithms. Japanese 880-01 Gurafu arugorizumu / R. Sejiwikku cho ; Taguchi Azuma, Takamatsu Mizuyo, Takazawa Kenjirō kyōyaku = Graph algorithms / Robert Sedgewick. 880-02 Tōkyō : Kindai Kagakusha, 2021. 1 online resource (xiv, 376 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier 880-03 Sejiwikku arugorizumu C = Algorithms in C ; dai 5-bu Online resource; title from PDF title page (EBSCO, viewed April 7, 2022). Includes bibliographical references (pages 369-370) and index. "Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years. Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4 , addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment. Coverage includes: A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C code, and detailed algorithm descriptions The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with numerous support materials for educators. A landmark revision, Algorithms in C, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications." -- Provided by publishers. Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 C (Computer program language) http://id.loc.gov/authorities/subjects/sh85018532 Algorithmes de graphes. C (Langage de programmation) C (Computer program language) fast Graph algorithms fast 880-04 Arugorizumu. jlabsh/4 880-05 Puroguramingu(Konpyūta). jlabsh/4 880-06 Taguchi, Azuma, translator. Sedgewick, Robert, 1946- Algorithms in C. Japanese ; pt. 5. FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=3098468 Volltext 245-01/$1 グラフアルゴリズム / R.セジウィック著 ; 田口東, 高松瑞代, 高澤兼二郎共訳 = Graph algorithms / Robert Sedgewick. 264-02/$1 東京 : 近代科学社, 2021. 490-03/$1 セジウィック: アルゴリズムC = Algorithms in C ; 第 5部 520-00/$1 "本書は『セジウィック：アルゴリズムC 第1〜4部』に続く，第5部の日本語版．グラフは，現実の問題をコンピュータで計算できるよう離散的な数学モデルに落とし込むための概念であり，本書は，その基礎として外せない項目を網羅している．また、グラフを現実的な時間で解くためのアルゴリズムを豊富に掲載しており，アルゴリズム研究の入門書としてもうってつけである．原著は，『アルゴリズムイントロダクション』と並び称される世界的名著．様々な分野でグラフおよびグラフアルゴリズムの知識が求められている今，待望の翻訳書といえる．"-- Provided by publisher. 650-04/$1 アルゴリズム. jlabsh/4 650-05/$1 プログラミング(コンピュータ). jlabsh/4 700-06/$1 田口東, translator. 758-00/$1 has work: グラフアルゴリズム (Text) https://id.oclc.org/worldcat/entity/E39PCYrQFCppJ6Q7vxYdFtW6mm https://id.oclc.org/worldcat/ontology/hasWork |
| spellingShingle | Sedgewick, Robert, 1946- Gurafu arugorizumu / Sedgewick, Robert, 1946- Algorithms in C. Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 C (Computer program language) http://id.loc.gov/authorities/subjects/sh85018532 Algorithmes de graphes. C (Langage de programmation) C (Computer program language) fast Graph algorithms fast 880-04 Arugorizumu. jlabsh/4 880-05 Puroguramingu(Konpyūta). jlabsh/4 |
| subject_GND | http://id.loc.gov/authorities/subjects/sh2002004605 http://id.loc.gov/authorities/subjects/sh85018532 |
| title | Gurafu arugorizumu / |
| title_alt | Graph algorithms. |
| title_auth | Gurafu arugorizumu / |
| title_exact_search | Gurafu arugorizumu / |
| title_full | Gurafu arugorizumu / R. Sejiwikku cho ; Taguchi Azuma, Takamatsu Mizuyo, Takazawa Kenjirō kyōyaku = Graph algorithms / Robert Sedgewick. |
| title_fullStr | Gurafu arugorizumu / R. Sejiwikku cho ; Taguchi Azuma, Takamatsu Mizuyo, Takazawa Kenjirō kyōyaku = Graph algorithms / Robert Sedgewick. |
| title_full_unstemmed | Gurafu arugorizumu / R. Sejiwikku cho ; Taguchi Azuma, Takamatsu Mizuyo, Takazawa Kenjirō kyōyaku = Graph algorithms / Robert Sedgewick. |
| title_short | Gurafu arugorizumu / |
| title_sort | gurafu arugorizumu |
| topic | Graph algorithms. http://id.loc.gov/authorities/subjects/sh2002004605 C (Computer program language) http://id.loc.gov/authorities/subjects/sh85018532 Algorithmes de graphes. C (Langage de programmation) C (Computer program language) fast Graph algorithms fast 880-04 Arugorizumu. jlabsh/4 880-05 Puroguramingu(Konpyūta). jlabsh/4 |
| topic_facet | Graph algorithms. C (Computer program language) Algorithmes de graphes. C (Langage de programmation) Graph algorithms Arugorizumu. Puroguramingu(Konpyūta). |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=3098468 |
| work_keys_str_mv | AT sedgewickrobert graphalgorithms AT taguchiazuma graphalgorithms AT sedgewickrobert gurafuarugorizumu AT taguchiazuma gurafuarugorizumu |