Last update: Sun Mar 31 03:12:29 MDT 2019
@Article{Berwanger:2012:ECD, author = "Dietmar Berwanger and Erich Gr{\"a}del and Lukasz Kaiser and Roman Rabinovich", title = "Entanglement and the complexity of directed graphs", journal = j-THEOR-COMP-SCI, volume = "463", number = "1", pages = "2--25", day = "7", month = dec, year = "2012", CODEN = "TCSCDI", DOI = "https://doi.org/10.1016/j.tcs.2012.07.010", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Wed Nov 7 09:19:00 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib", URL = "http://www.sciencedirect.com/science/article/pii/S030439751200669X", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", }