Graph-Theoretic Concepts in Computer Science: 45th International Workshop, WG 20
82,62 €
Logic and Random Graphs. - Unavoidability and universality of digraphs. - Subexponential algorithms for variants of homomorphism problem in string graphs. - The 4-Steiner Root Problem. - Hamiltonicity below Dirac's condition.
Jetzt bei Ebay:
