eBook
View in EDS

Combinatorial Algorithms : Enlarged Second Edition

Bibliographic Details
Title: Combinatorial Algorithms : Enlarged Second Edition
Description: Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9 shows how to mix known algorithms and create new ones, while Chapter 10 presents the'Chop-Sticks'algorithm, used to obtain all minimum cuts in an undirected network without applying traditional maximum flow techniques. This algorithm has led to the new mathematical specialty of network algebra. The text assumes no background in linear programming or advanced data structure, and most of the material is suitable for undergraduates. 153 black-and-white illus. 23 tables. Exercises, with answers at the ends of chapters.
Authors: T. C. Hu, M. T. Shing
Resource Type: eBook.
Subjects: Computer algorithms, Combinatorial analysis--Data processing, Operations research--Data processing
Categories: MATHEMATICS / Combinatorics
Database: eBook Index
FullText Text:
  Availability: 0
Header DbId: edsebk
DbLabel: eBook Index
An: 1155665
RelevancyScore: 900
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 899.57275390625
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Combinatorial Algorithms : Enlarged Second Edition
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9 shows how to mix known algorithms and create new ones, while Chapter 10 presents the'Chop-Sticks'algorithm, used to obtain all minimum cuts in an undirected network without applying traditional maximum flow techniques. This algorithm has led to the new mathematical specialty of network algebra. The text assumes no background in linear programming or advanced data structure, and most of the material is suitable for undergraduates. 153 black-and-white illus. 23 tables. Exercises, with answers at the ends of chapters.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22T%2E+C%2E+Hu%22">T. C. Hu</searchLink><br /><searchLink fieldCode="AR" term="%22M%2E+T%2E+Shing%22">M. T. Shing</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computer+algorithms%22">Computer algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorial+analysis--Data+processing%22">Combinatorial analysis--Data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Operations+research--Data+processing%22">Operations research--Data processing</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Combinatorics%22">MATHEMATICS / Combinatorics</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsebk&AN=1155665
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 511.6
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Computer algorithms
        Type: general
      – SubjectFull: Combinatorial analysis--Data processing
        Type: general
      – SubjectFull: Operations research--Data processing
        Type: general
    Titles:
      – TitleFull: Combinatorial Algorithms : Enlarged Second Edition
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: T. C. Hu
      – PersonEntity:
          Name:
            NameFull: M. T. Shing
      – PersonEntity:
          Name:
            NameFull: T. C. Hu
      – PersonEntity:
          Name:
            NameFull: M. T. Shing
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2012
            – D: 18
              M: 05
              Type: profile
              Y: 2018
          Identifiers:
            – Type: isbn-print
              Value: 9780486419626
            – Type: isbn-electronic
              Value: 9780486152943
          Titles:
            – TitleFull: Combinatorial Algorithms : Enlarged Second Edition
              Type: main
ResultId 1