Transcription of Fourth Edition - UOITC
{{id}} {{{paragraph}}}
Fourth EditionData Structuresand AlgorithmAnalysis inC++This page intentionally left blank Fourth EditionData Structuresand AlgorithmAnalysis inC++Mark Allen WeissFlorida International UniversityBostonColumbusIndianapolisNew YorkSan FranciscoUpper Saddle River Amsterdam Cape Town Dubai LondonMadridMilanMunichParisMontrealToro ntoDelhiMexico City Sao Paulo Sydney Hong Kong Seoul SingaporeTa i p e i To k y oEditorial Director, ECS: Marcia HortonCover Designer: Bruce KenselaarExecutive Editor: Tracy JohnsonPermissions Supervisor: Michael JoyceEditorial Assistant: Jenah Blitz-StoehrPermissions Administrator: Jenell ForschlerDirector of Marketing: Christy LeskoCover Image:c De-kay | Manager: Yez AlayanMedia Project Manager: Renata ButeraSenior Marketing Coordinator: Kathryn FerrantiFull-Service Project Management: Integra SoftwareMarketing Assistant: Jon BryantServices Pvt. of Production: Erin GreggComposition: Integra Software Services Pvt.
9.6.3 Euler Circuits 425 9.6.4 Directed Graphs 429 9.6.5 Finding Strong Components 431 9.7 Introduction to NP-Completeness 432 9.7.1 Easy vs. Hard 433 9.7.2 The Class NP 434 9.7.3 NP-Complete Problems 434 Summary 437 Exercises 437 References 445 Chapter10 Algorithm Design Techniques 449 10.1 Greedy Algorithms 449 10.1.1 A Simple Scheduling ...
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}