"On computational complexity of length embeddability of graphs."

Mikhail Tikhomirov (2014)

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