Effiziente Algorithmen zur Auflistung kombinatorischer Strukturen von Leslie Ann Goldberg
75,93 €
How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists?. Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs.
Jetzt bei Ebay:
