"On the Complexity of Frequent Subtree Mining in Very Simple Structures."

Pascal Welke, Tamás Horváth, Stefan Wrobel (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-319-23708-4_14

access: closed

type: Conference or Workshop Paper

metadata version: 2019-03-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ilp/WelkeHW14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/WelkeHW14
Pascal Welke, Tamás Horváth, Stefan Wrobel:
On the Complexity of Frequent Subtree Mining in Very Simple Structures. ILP 2014: 194-209

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.