室蘭工業大学蔵書検索システム
ログイン
  • 目録検索 検索メニュー ▼
  • マイライブラリ マイライブラリ ▼
    • 利用状況確認・貸出延長
    • ブックマーク
    • お気に入り検索
    • 新着アラート
    • 文献複写申込
    • 図書借用申込
    • 図書購入リクエスト

室蘭工業大学蔵書検索システム

Algorithms on Trees and Graphs : With Python Code

by Gabriel Valiente. -- 2nd ed. 2021. -- Springer International Publishing, 2021. -- (Texts in Computer Science). w. <EB00355565>
便利機能：
目次・あらすじを見る 詳細情報を見る
書誌URL：

Algorithms on Trees and Graphs : With Python Code

by Gabriel Valiente. -- 2nd ed. 2021. -- Springer International Publishing, 2021. -- (Texts in Computer Science). w. <EB00355565>
便利機能：
目次・あらすじを見る 詳細情報を見る
書誌URL：
このページのTOPへ

書誌詳細

書名・著者名等 Algorithms on Trees and Graphs : With Python Code / by Gabriel Valiente
資料種別 リモートファイル
版 2nd ed. 2021
出版者・出版年 Cham : Springer International Publishing : Imprint: Springer , 2021
形状・大きさ XV, 387 p. 145 illus : online resource
巻号情報
ISBN 9783030818852
シリーズ名等 Texts in Computer Science <>//a
内容著作注記 1. Introduction
内容著作注記 2. Algorithmic Techniques
内容著作注記 3. Tree Traversal
内容著作注記 4. Tree Isomorphism
内容著作注記 5. Graph Traversal
内容著作注記 6. Clique, Independent Set, and Vertex Cover
内容著作注記 7. Graph Isomorphism
注記 Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational biology, bioinformatics, and computational chemistry. This textbook introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses. Centered around the fundamental issue of graph isomorphism, the content goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. Numerous illustrations, examples, problems, exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference. Furthermore, Python code for all algorithms presented is given in an appendix. Topics and features: Algorithms are first presented on an intuitive basis, followed by a detailed exposition using structured pseudocode Correctness proofs are given, together with a worst-case analysis of the algorithms Full implementation of all the algorithms in Python An extensive chapter is devoted to the algorithmic techniques used in the book Solutions to all the problems Gabriel Valiente, PhD, is an accredited Full Professor at the Department of Computer Science and a member of the Algorithms, Bioinformatics, Complexity and Formal Methods Research Group of the Technical University of Catalonia in Barcelona, Spain. He has been lecturing on Data Structures and Algorithms at the undergraduate level and Advanced Graph Algorithms at the graduate level over the last several years. His current research is centered on combinatorial algorithms on graphs and, in particular, algorithms for comparing trees and graphs, with emphasis on alg
注記 orithms in computational biology and bioinformatics
NCID 9783030818876
本文の言語 英語
著者リンク *Valiente, Gabriel <> author
著者リンク SpringerLink (Online service) <>
分類 DC23:004.0151
件名 Computer science—Mathematics
件名 Discrete mathematics
件名 Algorithms
件名 Graph theory
件名 Python (Computer program language)
件名 C++ (Computer program language)
件名 Discrete Mathematics in Computer Science
件名 Algorithms
件名 Graph Theory
件名 Python
件名 C++
電子書籍・雑誌へアクセス https://doi.org/10.1007/978-3-030-81885-2
このページのTOPへ
このページのTOPへ

  • 関連情報

    関連資料

    他の検索サイトで探す

    NII書誌検索

    他の図書館から取り寄せる

    • 文献複写申込.

    この書誌のQRコード