著者名,書名,版表示,出版者名,出版年,シリーズ名,番号,ISBN,ISSN,URL
"Mehlhorn, Kurt",Graph algorithms and NP-completeness,,Springer-Verlag,1984,EATCS monographs on theoretical computer science,,"038713641X,354013641X",,https://cir.nii.ac.jp/crid/1130000794628207232