Publication:3216653
From MaRDI portal
zbMath0554.05002MaRDI QIDQ3216653
Publication date: 1984
computational complexity; generating functions; graph coloring; graph theory; recurrence relations; network algorithms; inclusion-exclusion; recursive programming; Polya's enumeration formula; Combinatorial modeling; covering circuits; games with graphs; general counting methods for arrangements and selections; trees and searching
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68R10: Graph theory (including graph drawing) in computer science
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05Cxx: Graph theory
05Axx: Enumerative combinatorics
Related Items
Rational divide-and-conquer relations, Representation of the Drazin inverse for special block matrix, Avoiding-sequences with minimum sum, A note on the distribution of the Wilcoxon rank sum statistic, Generalized Bell numbers and peirce matrix via Pascal matrix, Representations of the Drazin inverse for a class of block matrices, On the determinants of the square-type Stirling matrix and Bell matrix, On the average genus of a graph, Studies in Bessel functions via Laplace transforms