Graph-Theoretic Concepts in Computer Science: International Workshop WG '86 Bern
67,03 €
On approximation algorithms for Steiner's problem in graphs. - Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity. - ADA concurrency specified by graph grammars.
Jetzt bei Ebay: