Algorithms and Complexity: Third Italian Conference, CIAC'97, Rome, Italy, March
67,36 €
Embedding interconnection networks in grids via the Layered Cross Product. - Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5. - The optimum cost chromatic partition problem.
Jetzt bei Ebay:
