• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History

عنوان
Data structures and algorithms. 2, Graph algorithms and NP-completeness

پدید آورنده
Kurt Mehlhorn.

موضوع
Algorithms.,Computer programming.,Data structures (Computer science)

رده
QA76
.
9
.
D35
K878
1984

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

INTERNATIONAL STANDARD BOOK NUMBER

(Number (ISBN
3642698972
(Number (ISBN
9783642698972

NATIONAL BIBLIOGRAPHY NUMBER

Number
b572868

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Data structures and algorithms. 2, Graph algorithms and NP-completeness
General Material Designation
[Book]
First Statement of Responsibility
Kurt Mehlhorn.

.PUBLICATION, DISTRIBUTION, ETC

Place of Publication, Distribution, etc.
Berlin ; New York
Name of Publisher, Distributor, etc.
Springer-Verlag
Date of Publication, Distribution, etc.
1984

PHYSICAL DESCRIPTION

Specific Material Designation and Extent of Item
(xii, 260 pages) : illustrations

SERIES

Series Title
EATCS monographs on theoretical computer science, 2.

GENERAL NOTES

Text of Note
Rev. translation of: Effiziente Algorithmen. Stuttgart : Teubner, 1977.

CONTENTS NOTE

Text of Note
Vol. 2: Graph Algorithms and NP-Completeness --; IV. Algorithms on Graphs --; 1. Graphs and their Representation in a Computer --; 2. Topological Sorting and the Representation Problem --; 3. Transitive Closure of Acyclic Digraphs --; 4. Systematic Exploration of a Graph --; 5. A Close Look at Depth First Search --; 6. Strongly-Connected and Biconnected Components of Directed and Undirected Graphs --; 7. Least Cost Paths in Networks --; 8. Minimum Spanning Trees --; 9. Maximum Network Flow and Applications --; 10. Planar Graphs --; 11. Exercises --; 12. Bibliographic Notes --; V. Path Problems in Graphs and Matrix Multiplication --; 1. General Path Problems --; 2. Two Special Cases: Least Cost Paths and Transitive Closure --; 3. General Path Problems and Matrix Multiplication --; 4. Matrix Multiplication in a Ring --; 5. Boolean Matrix Multiplication and Transitive Closure --; 6. (Min, +)-Product of Matrices and Least Cost Paths --; 7. A Lower Bound on the Monotone Complexity of Matrix Multiplication --; 8. Exercises --; 9. Bibliographic Notes --; VI. NP-Completeness --; 1. Turing Machines and Random Access Machines --; 2. Problems, Languages and Optimization Problems --; 3. Reductions and NP-complete Problems --; 4. The Satisfiability Problem is NP-complete --; 5. More NP-complete Problems --; 6. Solving NP-complete Problems --; 7. Approximation Algorithms --; 8. The Landscape of Complexity Classes --; 9. Exercises --; 10. Bibliographic Notes --; IX. Algorithmic Paradigms.

TOPICAL NAME USED AS SUBJECT

Algorithms.
Computer programming.
Data structures (Computer science)

LIBRARY OF CONGRESS CLASSIFICATION

Class number
QA76
.
9
.
D35
Book number
K878
1984

PERSONAL NAME - PRIMARY RESPONSIBILITY

Kurt Mehlhorn.

PERSONAL NAME - ALTERNATIVE RESPONSIBILITY

Kurt Mehlhorn

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

[Book]

Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival