Computer Science Theory and Applications: 17th International Computer Science Sy
95,59 €
Coloring a Dominating Set without Conflicts: q-Subset Square Coloring. - Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs. - Output Sensitive Fault Tolerant Maximum Matching. - Bounds for Synchronizing Markov Decision Processes.
Jetzt bei Ebay:
