Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Chrobak:1991:POL, author = "M. Chrobak and D. Eppstein", title = "Planar orientations with low out-degree and compaction of adjacency matrices", journal = j-THEOR-COMP-SCI, volume = "86", number = "2", pages = "243--266", day = "02", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., California Univ., Riverside, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "adjacency matrices; compaction; computational complexity; data structure; EREW PRAM; graph theory; linear time; out-degree; parallel algorithms; parallel time; planar graph; time complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }