Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Combinatorial algorithms”

Combinatorial algorithms

Hu, T C, Shing, M T · 2002

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

Cited by 15

Combinatorial Algorithms

International Workshop on Combinatorial Algorithms 2025 Bozeman, Mont., Fernau, Henning, Zhu, Binhai · Lecture notes in computer science · 2025

Cited by 3Open access

Combinatorial Algorithms

Costas S. Iliopoulos, William F. Smyth, FRATI, FABRIZIO et al. · Lecture notes in computer science · 2011

Cited by 9

Combinatorial Algorithms

International Workshop on Combinatorial Algorithms 2024 Ischia, Rescigno, Adele Anna, Vaccaro, Ugo · Lecture notes in computer science · 2024

Cited by 44Open access

Combinatorial algorithms

Donald L. Kreher, Douglas R. Stinson · ACM SIGACT News · 1999

Our objective in writing this book was to produce a general, introductory textbook on the subject o f combinatorial algorithms . Several textbooks on combinatorial algorithms were written in the 1970s , and are now out-of-date . More recent books on algorithms have either been general textbooks , or books on specialized topics, such as graph algorithms to name one example . We felt that a new textbook on combinatorial algorithms, that emphasizes the basic techniques of generation , enumeration and search, would be very timely.

Cited by 116Open access

Combinatorial Algorithms

Sun‐Yuan Hsieh, Ling-Ju Hung, Chia‐Wei Lee · Lecture notes in computer science · 2023

Cited by 1Open access

Combinatorial Algorithms

Donald L. Kreher, Douglas R. Stinson · 2020

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:CombinationsPermutationsGraphsDesignsMany classical areas are covered as well as new research topics not included in most existing texts, such as:Group algorithmsGraph isomorphismHill-climbingHeuristic search algorithmsThis work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.

Cited by 11