Effiziente Algorithmen zur Auflistung kombinatorischer Strukturen
49,05 €
Among those families considered are unlabeled graphs, first-order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colorable graphs. In particular, the difficulty of evaluating Polya's cycle polynomial is demonstrated.
Jetzt bei Ebay:
