"Faster Algorithms for the Maximum Common Subtree Isomorphism Problem."

Andre Droschinsky, Nils M. Kriege, Petra Mutzel (2016)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2016.33

access: open

type: Conference or Workshop Paper

metadata version: 2023-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/DroschinskyKM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/DroschinskyKM16
Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. MFCS 2016: 33:1-33:14

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.