학술논문

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Document Type
Journal
Source
THEORETICAL COMPUTER SCIENCE; OCT 20 2004, 326 1-3, p137-p153, 17p.
Subject
Language
English
ISSN
03043975