Graph algorithms and NP-completeness

Author(s)

• Mehlhorn, Kurt

Bibliographic Information

Graph algorithms and NP-completeness

Kurt Mehlhorn

（EATCS monographs on theoretical computer science, 2 . Data structures and algorithms / Kurt Mehlhorn ; 2）

Springer-Verlag, 1984

• : us
• : gw

Note

Includes bibliography and index

Details

• NCID: BA00491948
• ISBN:
  • 038713641X
  • 354013641X
• Country Code: gw
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Berlin ; Tokyo
• Pages/Volumes: xii, 260 p.
• Size: 25 cm
• Parent Bibliography ID:
  • BA00007320