Graph Algorithms

We reviewGraph algorithm basicAlgorithm algorithm structure and provide a brief and dense review of the main principles of sequential algorithm design and analysis with focus on graph algorithms. We then provide a short survey of NP-completeness with example NP-hard graph problems. Finally, we brief...

Full description

Saved in:
Bibliographic Details
Published inGuide to Graph Algorithms pp. 37 - 76
Main Author Erciyes, K
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2018
Springer International Publishing
SeriesTexts in Computer Science
Online AccessGet full text
ISBN331973234X
9783319732343
ISSN1868-0941
1868-095X
DOI10.1007/978-3-319-73235-0_3

Cover

More Information
Summary:We reviewGraph algorithm basicAlgorithm algorithm structure and provide a brief and dense review of the main principles of sequential algorithm design and analysis with focus on graph algorithms. We then provide a short survey of NP-completeness with example NP-hard graph problems. Finally, we briefly review the major algorithm design methods showing their implementations for graph problems.
ISBN:331973234X
9783319732343
ISSN:1868-0941
1868-095X
DOI:10.1007/978-3-319-73235-0_3