"Faster algorithms for finding and counting subgraphs."

Fedor V. Fomin et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2011.10.001

access: open

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/FominLRSR12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/FominLRSR12
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao:
Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. 78(3): 698-706 (2012)

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.