Stop the war!
Остановите войну!
for scientists:
default search action
"The Complexity of the Matching-Cut Problem for Planar Graphs and Other ..."
Paul S. Bonsma (2003)
- Paul S. Bonsma:
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes. WG 2003: 93-105
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.