Stop the war!
Остановите войну!
for scientists:
default search action
"Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of ..."
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura (2020)
- Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura:
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree. Int. J. Found. Comput. Sci. 31(2): 253-273 (2020)
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.