@ARTICLE{FellowsFertinHermelinVialette2011,
AUTHOR = {Fellows, Michael R. and Fertin, Guillaume and Hermelin, Danny and Vialette, Stephane},
TITLE = {Upper and lower bounds for finding connected motifs in vertex-colored graphs},
JOURNAL = {Journal of Computer and System Sciences},
PUBLISHER = {Elsevier},
YEAR = {2011},
NUMBER = {4},
VOLUME = {77},
PAGES = {799--811},
ADDRESS = {Amsterdam},
ISBN = {0022-0000},
DOI = {10.1016/j.jcss.2010.07.003},
}
Entry last modified by Anja Becker, 02/09/2012
Edit History (please click the blue arrow to see the details)
 | Editor(s)
[Library] | Created
12/13/2011 11:44:05 |
Revisions
4.
3.
2.
1.
0. | Editor(s)
Anja Becker
Danny Hermelin
Danny Hermelin
Danny Hermelin
Danny Hermelin | Edit Dates
09.02.2012 10:49:43
12/13/2011 11:47:03 AM
12/13/2011 11:46:27 AM
12/13/2011 11:45:11 AM
12/13/2011 11:44:05 AM |