Parameterized and Exact Computation: Third International Workshop, IWPEC 2008, V
67,03 €
The 17 revised full papers presented together with 3 invited lectures were carefully reviewed and selected from 32 submissions. - Fixed Structure Complexity. - An O (1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs.
Jetzt bei Ebay:
