"Upper and lower bounds for finding connected motifs in vertex-colored graphs."

Michael R. Fellows et al. (2011)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2010.07.003

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/FellowsFHV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/FellowsFHV11
Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4): 799-811 (2011)

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.