Entry Orenstein:2011:TEC 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{Orenstein:2011:TEC,
author = "Yaron Orenstein and Dana Ron",
title = "Testing {Eulerianity} and connectivity in directed
sparse graphs",
journal = j-THEOR-COMP-SCI,
volume = "412",
number = "45",
pages = "6390--6408",
day = "21",
month = oct,
year = "2011",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2011.06.038",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Nov 29 19:11:39 MST 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397511006463",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- connectivity,
412(35)4613,
453(1)2,
463(1)26,
472(z)46,
493(z)46,
494(z)49,
496(z)2,
555(z)35,
560(z)292
- directed,
411(26)2502,
411(38)3493,
412(4)375,
412(8)901,
412(32)4173,
412(39)5325,
412(41)5744,
412(41)5752,
454(1)30,
457(1)1,
463(1)2,
465(z)35,
468(z)50,
485(z)1,
504(z)5,
513(z)25,
560(z)235
- Ron, Dana,
420(1)64
- sparse,
411(38)3516,
411(44)3894,
412(8)846,
412(16)1445,
421(1)1,
425(1)117,
439(1)41,
472(z)104,
479(z)22,
511(z)137,
526(z)120,
547(z)117,
552(z)109
- testing,
411(16)1770,
412(29)3555,
413(1)73,
420(1)64,
434(1)98,
451(1)70,
455(1)66,
497(z)39,
505(z)11,
511(z)137,
513(z)65,
524(z)90,
526(z)75,
538(z)16