"A note on the hardness of graph diameter augmentation problems"

James Nastos, Yong Gao (2009)

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