External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Algorithmes exacts et exponentiels pour les problèmes NP-difficiles sur les graphes et hypergraphes. (Exact Exponential-Time Algorithms for NP-hards Problems on Graphs and Hypergraphs)

Manfred Cochefert. Algorithmes exacts et exponentiels pour les problèmes NP-difficiles sur les graphes et hypergraphes. (Exact Exponential-Time Algorithms for NP-hards Problems on Graphs and Hypergraphs). PhD thesis, University of Lorraine, Nancy, France, 2014. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on