"Counting thin subgraphs via packings faster than meet-in-the-middle time."

Andreas Björklund, Petteri Kaski, Lukasz Kowalik (2013)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics