Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/001469185/catalog> ?p ?o. }

• catalog contributor b2086670.
• catalog created "c1984.".
• catalog date "1984".
• catalog date "c1984.".
• catalog dateCopyrighted "c1984.".
• catalog description "1. Elements of graph theory : Graph models ; Isomorphism ; A simple counting formula ; Planar graphs ; Summary and references -- 2. Covering circuits and graph coloring : Euler circuits ; Hamilton circuits ; Graph coloring ; Coloring theorems ; Summary and references -- 3. Trees and searching : Properties of trees ; Enumeration with trees ; The traveling salesperson problem ; Spanning trees and graph algorithms ; Tree analysis of sorting algorithms ; Summary and references -- 4. Network algorithms : Shortest path ; Minimal spanning trees ; Network flows ; Algorithmic matching ; Summary and references -- 5. General counting methods for arrangements and selections : Two basic counting principles ; Simple arrangements and selections ; Arrangements and selections with repetition ; Distributions ; Binomial coefficients ; Generating permutations and combinations and programming projects ; Summary and references -- ".
• catalog description "11. Games with graphs : Graph model for instant insanity ; Progressively finite games ; Nim-type games ; Summary and references -- Appendix : Set theory and logic ; Mathematical induction ; A little probability ; The pigeonhole principles ; Mastermind.".
• catalog description "6. Generating functions : Generating function models ; Calculating coefficients of generating functions ; Partitions ; Exponential generating functions ; A summation method ; Summary and references -- 7. Recurrence relations : Recurrence relation models ; Divide-and-conquer relations ; Recursive programming ; Solution of linear recurrence relations ; Solution of inhomogeneous recurrence relations ; Solutions with generating functions ; Summary and references -- 8. Inclusion-exclusion : Counting with Venn diagrams ; Inclusion-exclusion formula ; Restricted positions and rook polynomials ; Summary and references -- 9. Polya's enumeration formula : Equivalence and symmetry groups ; Burnside's Lemma ; The cycle index ; Polya's function ; Summary and references -- 10. COmbinatorial modeling in theoretical computer science : Formal languages and grammars ; Finite-state machines ; Logical propositions and computational complexity ; Summary and references -- ".
• catalog description "Bibliography: p. 435-436.".
• catalog extent "xi, 447 p. :".
• catalog hasFormat "Applied combinatorics.".
• catalog identifier "0471863718 :".
• catalog isFormatOf "Applied combinatorics.".
• catalog issued "1984".
• catalog issued "c1984.".
• catalog language "eng".
• catalog publisher "New York : Wiley,".
• catalog relation "Applied combinatorics.".
• catalog subject "511/.6 19".
• catalog subject "Combinatorial analysis".
• catalog subject "Combinatorial analysis.".
• catalog subject "Graph theory.".
• catalog subject "QA164 .T83 1984".
• catalog tableOfContents "1. Elements of graph theory : Graph models ; Isomorphism ; A simple counting formula ; Planar graphs ; Summary and references -- 2. Covering circuits and graph coloring : Euler circuits ; Hamilton circuits ; Graph coloring ; Coloring theorems ; Summary and references -- 3. Trees and searching : Properties of trees ; Enumeration with trees ; The traveling salesperson problem ; Spanning trees and graph algorithms ; Tree analysis of sorting algorithms ; Summary and references -- 4. Network algorithms : Shortest path ; Minimal spanning trees ; Network flows ; Algorithmic matching ; Summary and references -- 5. General counting methods for arrangements and selections : Two basic counting principles ; Simple arrangements and selections ; Arrangements and selections with repetition ; Distributions ; Binomial coefficients ; Generating permutations and combinations and programming projects ; Summary and references -- ".
• catalog tableOfContents "11. Games with graphs : Graph model for instant insanity ; Progressively finite games ; Nim-type games ; Summary and references -- Appendix : Set theory and logic ; Mathematical induction ; A little probability ; The pigeonhole principles ; Mastermind.".
• catalog tableOfContents "6. Generating functions : Generating function models ; Calculating coefficients of generating functions ; Partitions ; Exponential generating functions ; A summation method ; Summary and references -- 7. Recurrence relations : Recurrence relation models ; Divide-and-conquer relations ; Recursive programming ; Solution of linear recurrence relations ; Solution of inhomogeneous recurrence relations ; Solutions with generating functions ; Summary and references -- 8. Inclusion-exclusion : Counting with Venn diagrams ; Inclusion-exclusion formula ; Restricted positions and rook polynomials ; Summary and references -- 9. Polya's enumeration formula : Equivalence and symmetry groups ; Burnside's Lemma ; The cycle index ; Polya's function ; Summary and references -- 10. COmbinatorial modeling in theoretical computer science : Formal languages and grammars ; Finite-state machines ; Logical propositions and computational complexity ; Summary and references -- ".
• catalog title "Applied combinatorics / Alan Tucker.".
• catalog type "text".