Stop the war!
Остановите войну!
for scientists:
default search action
"Efficient frequent connected subgraph mining in graphs of bounded tree-width."
Tamás Horváth, Jan Ramon (2010)
- Tamás Horváth, Jan Ramon:
Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theor. Comput. Sci. 411(31-33): 2784-2797 (2010)
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.