{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T09:48:39Z","timestamp":1725875319253},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540543430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028284","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:52:14Z","timestamp":1132638734000},"page":"461-472","source":"Crossref","is-referenced-by-count":7,"title":["Algorithms for generating all spanning trees of undirected, directed and weighted graphs"],"prefix":"10.1007","author":[{"given":"Sanjiv","family":"Kapoor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Ramesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"J. P. Char: Generation of trees, 2 trees and storage of master forests, IEEE Trans. Circuit Theory, CT-15, 1968.","DOI":"10.1109\/TCT.1968.1082817"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Harold N. Gabow: Two algorithms for generating weighted spanning trees in order, SIAM J. Comp., Vol 6, No. 1, March 1977.","DOI":"10.1137\/0206011"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"H. N. Gabow and E. W. Myers: Finding all spanning trees of directed and undirected graphs, SIAM J. Comp., Vol 7, No. 3, Aug 1978.","DOI":"10.1137\/0207024"},{"key":"41_CR4","unstructured":"W. Mayeda: Graph Theory, John Wiley, NY 1972."},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"G. J. Minty: A simple algorithm for listing all trees of a graph, IEEE Trans. Circuit Theory, CT-12, 1965.","DOI":"10.1109\/TCT.1965.1082385"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"R. C. Read and R. E. Tarjan: Bounds on backtrack algorithms for listing cycles, paths and spanning trees, Networks, 5, No. 3, 1975.","DOI":"10.1002\/net.1975.5.3.237"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028284.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:58:45Z","timestamp":1607551125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540543430"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0028284","relation":{},"subject":[]}}