Applied and algorithmic graph theory

書誌事項

Applied and algorithmic graph theory

Gary Chartrand, Ortrud R. Oellermann

(International series in pure and applied mathematics)

McGraw-Hill, c1993

  • : International ed.

大学図書館所蔵 件 / 20

この図書・雑誌をさがす

注記

Includes bibliographical references and index

内容説明・目次

内容説明

Designed as the bridge to cross the widening gap between mathematics and computer science, and planned as the mathematical base for computer science students, this maths text is written for upper-level college students who have had previous coursework involving proofs and proof techniques. The close tie between the theoretical and algorithmic aspects of graph theory, and graphs that lend themselves naturally as models in computer science, results in a need for efficient algorithims to solve any large scale problems. Each algorithm in the text includes explanatory statements that clarify individual steps, a worst-case complexity analysis, and algorithmic correctness proofs. As a result, the student will develop an understanding of the concept of an efficient algorithm.

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

  • NII書誌ID(NCID)
    BA19848294
  • ISBN
    • 0075571013
    • 0071125752
  • LCCN
    92006479
  • 出版国コード
    us
  • タイトル言語コード
    eng
  • 本文言語コード
    eng
  • 出版地
    New York
  • ページ数/冊数
    xvii, 395 p.
  • 大きさ
    25 cm
  • 分類
  • 件名
  • 親書誌ID
ページトップへ