Stop the war!
Остановите войну!
for scientists:
default search action
"Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete."
Osamu Maruyama, Satoru Miyano (1995)
- Osamu Maruyama, Satoru Miyano:
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete. MFCS 1995: 257-266
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.