The Complexity of the Matching-Cut Problem for Various Graph Classes

  • P.S. Bonsma (Speaker)

Activity: Talk or presentationOral presentation

Period14 May 2003
Event title2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2003
Event typeWorkshop
OrganisersUniversity of Cologne, University of Twente
LocationEnschede, Netherlands