Counting Connected Subgraphs with Maximum-Degree-Aware Sieving

Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto. Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. In Wen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao, editors, 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan. Volume 123 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Authors

Andreas Björklund

This author has not been identified. Look up 'Andreas Björklund' in Google

Thore Husfeldt

This author has not been identified. Look up 'Thore Husfeldt' in Google

Petteri Kaski

This author has not been identified. Look up 'Petteri Kaski' in Google

Mikko Koivisto

This author has not been identified. Look up 'Mikko Koivisto' in Google