{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:19:16Z","timestamp":1648937956006},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01303205","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T14:04:23Z","timestamp":1111759463000},"page":"209-229","source":"Crossref","is-referenced-by-count":0,"title":["On depth first search strees inm-out digraphs"],"prefix":"10.1007","volume":"13","author":[{"given":"W. C.","family":"Stephen Suen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579172","volume":"1","author":"M. Ajtai","year":"1981","unstructured":"Ajtai, M., Koml\u00f3s, J., andSzemer\u00e9di, E.: The longest path in a random graph,Combinatorica 1 (1981), 1?12.","journal-title":"Combinatorica"},{"key":"CR2","unstructured":"Bollob\u00e1s, B. Random Graphs, Academic Press, (1985)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(86)90171-8","volume":"59","author":"T. I. Fenner","year":"1986","unstructured":"Fenner, T. I., andFrieze, A. M. On large matchings and cycles in sparse random graphs,Discrete Mathematics 59, (1986), 243?256.","journal-title":"Discrete Mathematics"},{"key":"CR4","first-page":"335","volume":"14","author":"W. Fernandez de la Vega","year":"1979","unstructured":"Fernandez de la Vega, W. Long paths in random graphs,Studia Sci. Math. Hung. 14 (1979), 335?340.","journal-title":"Studia Sci. Math. Hung."},{"key":"CR5","unstructured":"Gibbons, A. Algorithmic Graph Theory, Cambridge University Press, (1985)."},{"key":"CR6","volume-title":"A Course in Mathematical Analysis","author":"E. Goursat","year":"1959","unstructured":"Goursat, E. A Course in Mathematical Analysis, Vol. 1 Dover Publ., New York, (1959)."},{"key":"CR7","unstructured":"Suen, S. PhD dissertation, University of Bristol, UK, (1985)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0012-365X(91)90305-L","volume":"94","author":"S. Suen","year":"1991","unstructured":"Suen, S. On the largest strong components inm-out digraphs,Discrete Math 94 (1991), 45?52.","journal-title":"Discrete Math"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/0095-8956(92)90021-O","volume":"56","author":"S. Suen","year":"1992","unstructured":"Suen, S. On large induced tree and long induced cycles in sparse random graphs,J. Combinat. Th. Ser. B. 56 (1992), 250?262.","journal-title":"J. Combinat. Th. Ser. B."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R. Depth first and linear graph algorithms,SIAM. J. Comput 1 (1972), 146?160.","journal-title":"SIAM. J. Comput"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303205.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01303205\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:08:44Z","timestamp":1556647724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01303205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01303205"],"URL":"https:\/\/doi.org\/10.1007\/bf01303205","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}