{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:10Z","timestamp":1725664570524},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_82","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:53:31Z","timestamp":1330278811000},"page":"428-439","source":"Crossref","is-referenced-by-count":2,"title":["Faster enumeration of all spanning trees of a directed graph"],"prefix":"10.1007","author":[{"given":"Ramesh","family":"Hariharan","sequence":"first","affiliation":[]},{"given":"Sanjiv","family":"Kapoor","sequence":"additional","affiliation":[]},{"given":"Vijay","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"37_CR1","volume-title":"RC3190","author":"S. M. Chase","year":"1970","unstructured":"S. M. Chase, Analysis for algorithms for finding all spanning trees of a graph, RC3190, IBM T.J. Watson Research Center, Yorktown Heights, NY, Dec. 1970."},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"H. N. Gabow, Two algorithms for generating weighted spanning trees in order, SIAM J. Comput., vol. 6, pp. 139\u2013150, Mar 77.","DOI":"10.1137\/0206011"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"H. N. Gabow and E. W. Myers, Finding all spanning trees of directed and undirected graphs, SIAM J. Comput., vol. 7, no. 3, Aug 78.","DOI":"10.1137\/0207024"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel, R. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. Comput., 13, 1984, 338\u2013355.","journal-title":"SIAM J. Comput."},{"key":"37_CR5","unstructured":"S. Kapoor, H. Ramesh. Algorithms for generating all spanning trees of undirected, directed and weighted graphs, Workshop on Algorithms and Data Structures, LCNS 519, Ottawa, 1991."},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"S. Kapoor, H. Ramesh. Algorithms for generating all spanning trees of undirected and weighted graphs, To appear in SIAM J. Comput., 1995.","DOI":"10.1137\/S009753979225030X"},{"key":"37_CR7","first-page":"252","volume-title":"Graph Theory","author":"W. Mayeda","year":"1972","unstructured":"W. Mayeda. Graph Theory, John Wiley, NY 1972, 252\u2013264."},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/TCT.1965.1082385","volume":"12","author":"G.J. Minty","year":"1965","unstructured":"G.J. Minty, A simple algorithm for listing all trees of a graph, IEEE Trans. Circuit Theory, vol. CT-12, pp. 120, 1965.","journal-title":"IEEE Trans. Circuit Theory"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan, On the efficiency of a good but not linear set merging algorithm, J. of ACM, 22, 2, April 75.","DOI":"10.1145\/321879.321884"},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"R. E. Tarjan","year":"1975","unstructured":"R. E. Tarjan, R. C. Read, Bounds on backtrack algorithms for listing cycles, paths and spanning trees, Networks, 5, 1975, pp. 237\u2013252.","journal-title":"Networks"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber, U. Vishkin. On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput., 17, 1988, 1253\u20131262.","journal-title":"SIAM J. Comput."},{"key":"37_CR12","first-page":"45","volume":"51","author":"S. Shinoda","year":"1968","unstructured":"S. Shinoda. Finding all possible directed trees of a directed graph, Electron Communication, Japan, 51-A, 1968, 45\u201347.","journal-title":"Electron Communication, Japan"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_82.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:14Z","timestamp":1605646574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}