Welcome to IOU Digital Library

A scholarly work focusing on the design and analysis of efficient algorithms for enumerating combinatorial structures. The book covers theoretical foundations, algorithmic techniques, and practical applications in areas such as graph theory, permutations, and combinations, making it suitable for researchers, advanced students, and professionals in computer science and mathematics.

no reviews

245: $a: Efficient Algorithms for Listing Combinatorial Structures
245: $b:
082: $a:
100: $a: Leslie Ann Goldberg
650: $a: Mathematics
250: $a: 1st
440: $v:
250: $b: Cambridge University Press
250: $c: 1997
020: $a: 9780521450218
300: $a: 320