View in EDS

Solving NP-hard problems on graphs that are almost trees and an application to facility location problems.

Saved in:
Bibliographic Details
Title: Solving NP-hard problems on graphs that are almost trees and an application to facility location problems.
Authors: Gurevich, Yuri, Stockmeyer, Larry, Vishkin, Uzi
Source: Journal of the ACM; July 1984, Vol. 31, p459-473, 15p
Database: Applied Science & Technology Source
Be the first to leave a comment!
You must be logged in first