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.

The Complexity of the Matching-Cut Problem

Maurizio Patrignani, Maurizio Pizzonia. The Complexity of the Matching-Cut Problem. In Andreas Brandstädt, Van Bang Le, editors, Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings. Volume 2204 of Lecture Notes in Computer Science, pages 284-295, Springer, 2001. [doi]

Abstract

Abstract is missing.

runs on