@article{ Tarjan1975,
  abstract = {Backtrack algorithms for listing certain kinds of subgraphs of a graph are described and analyzed. Included are algorithms for listing all spanning trees, all cycles, all simple cycles, or all of certain other kinds of paths. The algorithms have O(V+E) space requirements and O(V+E+EN) time requirements, if the problem graph has V vertices, E edges, and N subgraphs of the type to be listed.},
  annote = {From Duplicate 2 ( },
  author = {Tarjan, R E and Read, R C},
  doi = {MY/Tarjan_Read_1975_Networks},
  journal = {Networks},
  number = {3},
  pages = {237--252},
  title = {{Bounds on backtrack algorithms for listing cycles, paths, and spanning trees}},
  url = {http://scholar.google.com/scholar?hl=en\&btnG=Search\&q=intitle:Bounds+on+backtrack+algorithms+for+listing+cycles,+paths,+and+Spanning+trees.#0},
  volume = {5},
  year = {1975}
}

{"_id":"fkjpWRC5YwMGkaeAT","authorIDs":[],"author_short":["Tarjan","E, R","Read","C, R"],"bibbaseid":"tarjan-e-read-c-boundsonbacktrackalgorithmsforlistingcyclespathsandspanningtrees-1975","bibdata":{"abstract":"Backtrack algorithms for listing certain kinds of subgraphs of a graph are described and analyzed. Included are algorithms for listing all spanning trees, all cycles, all simple cycles, or all of certain other kinds of paths. The algorithms have O(V+E) space requirements and O(V+E+EN) time requirements, if the problem graph has V vertices, E edges, and N subgraphs of the type to be listed.","annote":"From Duplicate 2 (","author":["Tarjan","E, R","Read","C, R"],"author_short":["Tarjan","E, R","Read","C, R"],"bibtex":"@article{ Tarjan1975,\n abstract = {Backtrack algorithms for listing certain kinds of subgraphs of a graph are described and analyzed. Included are algorithms for listing all spanning trees, all cycles, all simple cycles, or all of certain other kinds of paths. The algorithms have O(V+E) space requirements and O(V+E+EN) time requirements, if the problem graph has V vertices, E edges, and N subgraphs of the type to be listed.},\n annote = {From Duplicate 2 ( },\n author = {Tarjan, R E and Read, R C},\n doi = {MY/Tarjan_Read_1975_Networks},\n journal = {Networks},\n number = {3},\n pages = {237--252},\n title = {{Bounds on backtrack algorithms for listing cycles, paths, and spanning trees}},\n url = {http://scholar.google.com/scholar?hl=en\\&btnG=Search\\&q=intitle:Bounds+on+backtrack+algorithms+for+listing+cycles,+paths,+and+Spanning+trees.#0},\n volume = {5},\n year = {1975}\n}","bibtype":"article","doi":"MY/Tarjan_Read_1975_Networks","id":"Tarjan1975","journal":"Networks","key":"Tarjan1975","number":"3","pages":"237--252","title":"Bounds on backtrack algorithms for listing cycles, paths, and spanning trees","type":"article","url":"http://scholar.google.com/scholar?hl=en\\&btnG=Search\\&q=intitle:Bounds+on+backtrack+algorithms+for+listing+cycles,+paths,+and+Spanning+trees.#0","volume":"5","year":"1975","bibbaseid":"tarjan-e-read-c-boundsonbacktrackalgorithmsforlistingcyclespathsandspanningtrees-1975","role":"author","urls":{"Paper":"http://scholar.google.com/scholar?hl=en\\&btnG=Search\\&q=intitle:Bounds+on+backtrack+algorithms+for+listing+cycles,+paths,+and+Spanning+trees.#0"},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:45.508Z","downloads":0,"keywords":[],"search_terms":["bounds","backtrack","algorithms","listing","cycles","paths","spanning","trees","tarjan","e","read","c"],"title":"Bounds on backtrack algorithms for listing cycles, paths, and spanning trees","year":1975,"dataSources":["YRMeqhMHoNu9HzJoC"]}