"The second order degree sequence problem is NP-complete."

Péter L. Erdös, István Miklós (2016)

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