Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Maon:1986:PED,
author = "Y. Maon and B. Schieber and U. Vishkin",
title = "Parallel ear decomposition search ({EDS}) and
st-numbering in graphs",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "277--298",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. Comput. Sci., Tel Aviv Univ., Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "biconnected graph; computational complexity;
concurrent-read concurrent-write PRAM; depth-first
search; efficient search method; Even-Tarjan linear
time-serial algorithm; graph planarity testing; graph
theory; NC; parallel algorithm; parallel algorithms;
parallel ear decomposition search; parallel undirected
graphs; s t-numbering",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}