عنوان

Graphs, Networks and Algorithm

شابک

9783642322785

کد کشور

IR

شماره

EN-52340

زبان متن نوشتاري يا گفتاري و مانند آن

انگلیسی

کشور محل نشر

IR

عنوان اصلي

Graphs, Networks and Algorithm

نام عام مواد

[Book]

ساير اطلاعات عنواني

:[delta

نام نخستين پديدآور

/ by Dieter Jungnickel

وضعيت ويراست

4th ed. 2013.

محل نشرو پخش و غیره

Berlin, Heidelberg

نام ناشر، پخش کننده و غيره

: Springer Berlin Heidelberg :Imprint: Springer,

تاریخ نشرو بخش و غیره

, 2013.

نام خاص و کميت اثر

XX, 675 p. 211 illus., online resource.

عنوان فروست

(Algorithms and Computation in Mathematics,1431-1550

مشخصه جلد

; 5)

متن يادداشت

Electronic

متن يادداشت

From the reviews of the previous editions ".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..." K.Engel, Mathematical Reviews 2002 The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons, Zentralblatt f?╝r Mathematik2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises - as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added.

متن يادداشت

Prefaces -- Basic Graph Theory -- Algorithms and Complexity -- Shortest Paths -- Spanning Trees -- The Greedy Algorithm -- Flows -- Combinatorial Applications -- Connectivity and Depth First Search -- Colorings -- Circulations -- The Network Simplex Algorithm -- Synthesis of Networks -- Matchings -- Weighted Matchings -- A Hard Problem: The TSP -- Appendix A: Some NP-Complete Problems -- Appendix B: Solutions -- Appendix C: List of Symbols -- References -- Index.?╗╣

عنوان

Algorithms and Computation in Mathematics,1431-1550

شماره جلد

5

موضوع مستند نشده

Mathematics

موضوع مستند نشده

Computer science

موضوع مستند نشده

Combinatorics

موضوع مستند نشده

Mathematical optimization

موضوع مستند نشده

Electronic books

شماره رده

مستند نام اشخاص تاييد نشده

Jungnickel, Dieter.

مستند نام اشخاص تاييد نشده

SpringerLink (Online service)

کشور

ایران

نام ميزبان

9783642322778.pdf

شماره دسترسي

عادی

اطلاعات مختصر

عادی

تاريخ و ساعت مذاکره و دسترسي

9783642322778.pdf

نوع فرمت الکترونيکي

متن

وضعیت فهرست نویسی

old catalog

فرمت انتشار

e

نوع ماده

BL

پیشوند ISBD اعمال شده است

1

سطح دسترسي

a

تكميل شده

Y