Entry Dondi:2013:FAC from tcs2010.bib
Last update: Sun Mar 31 03:12:29 MDT 2019
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Dondi:2013:FAC,
author = "Riccardo Dondi and Guillaume Fertin and St{\'e}phane
Vialette",
title = "Finding approximate and constrained motifs in graphs",
journal = j-THEOR-COMP-SCI,
volume = "483",
number = "??",
pages = "10--21",
day = "29",
month = apr,
year = "2013",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon May 6 18:32:37 MDT 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397512007979",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- approximate,
411(1)164,
411(40)3701,
411(43)3814,
412(29)3537,
412(29)3579,
412(39)5298,
412(45)6359,
426(1)1,
432(1)28,
439(1)58,
447(1)120,
463(1)96,
479(z)127,
481(z)9,
487(z)37,
521(z)42,
525(z)60
- constrained,
411(31)2818,
411(34)3073,
412(8)901,
412(32)4081,
432(1)1,
434(1)11,
447(1)100,
457(1)1,
521(z)123,
527(z)50,
551(z)55
- Dondi, Riccardo,
429(1)36,
454(1)51,
511(z)159,
530(z)66
- Fertin, Guillaume,
411(26)2475,
440(0)14,
494(z)122
- finding,
411(7)1212,
411(16)1742,
411(26)2475,
412(35)4579,
412(39)5325,
423(1)50,
428(1)10,
443(1)10,
447(1)74,
462(1)59,
468(z)92,
491(z)136,
550(z)21,
554(z)2,
556(z)85
- motif,
412(8)922,
460(1)94,
525(z)89,
548(z)1
- Vialette, Stéphane,
411(4)716,
411(26)2475