Graph-Theoretic Concepts in Computer Science: 16th International Workshop WG '90
68,21 €
Several papers take the form of preliminary reports on ongoing research. Optimal parallel algorithms for sparse graphs. - Finding minimally weighted subgraphs. - Avoiding matrix multiplication. - Induced subraph isomorphism for cographs is NP-complete.
Jetzt bei Ebay:
