Stop the war!
Остановите войну!
for scientists:
default search action
"On the NP-completeness of the perfect matching free subgraph problem."
Mathieu Lacroix et al. (2012)
- Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin, Christophe Picouleau:
On the NP-completeness of the perfect matching free subgraph problem. Theor. Comput. Sci. 423: 25-29 (2012)
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.