Entry Nikolopoulos:2012:ITC 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{Nikolopoulos:2012:ITC,
author = "Stavros D. Nikolopoulos and Leonidas Palios",
title = "An {$O(n m)$}-time certifying algorithm for
recognizing {HHD}-free graphs",
journal = j-THEOR-COMP-SCI,
volume = "452",
number = "1",
pages = "117--131",
day = "21",
month = sep,
year = "2012",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2012.06.006",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Jul 27 06:28:07 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397512005427",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- certifying,
412(39)5351
- Nikolopoulos, Stavros D.,
411(7)967,
439(1)41,
526(z)41
- Palios, Leonidas,
439(1)41,
526(z)41
- recognizing,
521(z)1,
528(z)1
- time,
411(2)470,
411(6)837,
411(16)1883,
411(16)1889,
411(22)2174,
411(40)3553,
411(40)3685,
411(49)4217,
412(3)192,
412(3)225,
412(4)281,
412(4)320,
412(12)1081,
412(18)1745,
412(20)1884,
412(22)2425,
412(24)2623,
412(28)3378,
412(29)3413,
412(32)4100,
412(32)4110,
412(33)4260,
412(36)4841,
412(39)5333,
412(39)5420,
412(48)6712,
412(48)6786,
414(1)76,
416(1)87,
417(1)2,
417(1)23,
423(1)1,
425(1)58,
429(1)292,
434(1)1,
436(1)106,
438(1)55,
447(1)74,
448(1)47,
455(1)98,
465(z)35,
470(z)93,
474(z)1,
478(z)118,
483(z)171,
487(z)65,
487(z)95,
494(z)2,
494(z)75,
501(z)1,
501(z)72,
502(z)46,
502(z)64,
507(z)34,
509(z)51,
509(z)122,
511(z)23,
512(z)15,
513(z)65,
518(z)117,
519(z)140,
521(z)62,
526(z)58,
538(z)103,
542(z)83,
542(z)108,
544(z)74,
547(z)46,
550(z)1,
560(z)190
- time, -,
412(18)1745,
448(1)47,
494(z)75,
518(z)117