A4C.1 Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal

Просмотров: 24 | Время: 24:56 | Голосов: +1 +1 | Скачать

Скачать клип A4C.1 Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal