Re: Reduce from X to "maximum acyclic subgraph"?

From: Stephen Harris (cyberguard1048-usenet_at_yahoo.com)
Date: 12/09/04 

Date: Thu, 09 Dec 2004 00:38:17 GMT

"Niklas Pettersson" <Niklas.Pettersson@msi.vxu.se> wrote in message
news:cp7nmf$9j3$1@news.lth.se...
> Hi again,
>
> I found information that Karp did this reduction in 1972 in a Paper called
> "Reducibility among combinatorial problems". Does anybody now where to
> find a copy?
>
> /
> Niklas
>
>

Maybe the paper will be included in this book, in our library system.

      Conference Symposium in Applied Mathematics. New York, 1973
      Title Complexity of computation / [edited by Richard M. Karp]
      Publisher Providence, R.I. : American Mathematical Society, 1974
      Description vii, 166 p. : ill. ; 26 cm
      Series SIAM-AMS proceedings ; v. 7
      Series SIAM-AMS proceedings.v. 7
      Note "Proceedings of a symposium in applied mathematics of the
American Mathematical Society and the Society for Industrial and Applied
Mathematics held in New York City April 18-19, 1973."
      Note Includes bibliographies and indexes
      ISBN 0821813277
      Language English
      Subject Machine theory -- Congresses
      Computer science -- Mathematics -- Congresses
      Numerical analysis -- Data processing
      Added Entry Karp, Richard M., 1935-
      Added Entry American Mathematical Society
      Society for Industrial and Applied Mathematics
      Format Conference
     Book