عنوان

Algorithmic graph theory /

شابک

0521246598

شابک

0521288819 (pbk.)

شابک

9780521246590

شابک

9780521288811 (pbk.)

شماره

b528336

عنوان اصلي

Algorithmic graph theory /

نام عام مواد

[Book]

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

Alan Gibbons.

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

New York :

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

Cambridge University Press,

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

1985.

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

xii, 259 p. :

ساير جزييات

diagrs. ;

ابعاد

24 cm.

متن يادداشت

Includes bibliographical references and indexes.

متن يادداشت

1. Introducing graphs and algorithmic complexity -- 2. Spanning-trees, branchings and connectivity -- 3. Planar graphs -- 4. Networks and flows -- 5. Matchings -- 6. Eulerian and Hamiltonian tours -- 7. Colouring graphs -- 8. Graph problems and intractability.

بدون عنوان

1

متن يادداشت

"This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text."--Book cover.

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

Graph theory-- Data processing.

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

Graph theory.

شماره رده

نشانه اثر

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

Gibbons, Alan, (Alan M.)

تاريخ عمليات

20140203034732.0

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

نوع ماده

[Book]

تكميل شده

Y