{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:14:57Z","timestamp":1725578097235},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642194221"},{"type":"electronic","value":"9783642194238"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19423-8_23","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T01:18:31Z","timestamp":1297300711000},"page":"214-220","source":"Crossref","is-referenced-by-count":0,"title":["Pre-processed Depth First Search"],"prefix":"10.1007","author":[{"given":"Rushabh","family":"Hathi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irfan A.","family":"Siddavatam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Naverniouk, I., Chu, F.: Graph algorithms, \n                    \n                      http:\/\/www.cs.cornell.edu\/~wdtseng\/icpc\/notes\/graph_part1.pdf"},{"key":"23_CR2","unstructured":"Chen, J.: Converter introductory graph theory part I, \n                    \n                      http:\/\/activities.tjhsst.edu\/sct\/lectures\/graph1.pdf"},{"key":"23_CR3","unstructured":"From Wikipedia, the free encyclopedia, \n                    \n                      http:\/\/en.wikipedia.org\/wiki\/Breadth-first_search"},{"key":"23_CR4","unstructured":"From Wikipedia, the free encyclopedia, \n                    \n                      http:\/\/en.wikipedia.org\/wiki\/Depth-first_search"},{"key":"23_CR5","unstructured":"From Bioinformatics Wikidot, \n                    \n                      http:\/\/bioinformatics.wikidot.com\/graph-theory-algorithms"},{"key":"#cr-split#-23_CR6.1","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn., pp. 540???549. MIT Press, McGraw-Hill (2001);"},{"key":"#cr-split#-23_CR6.2","unstructured":"Section 22.3: Depth-first search"},{"key":"23_CR7","volume-title":"The art of computer programming 1","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The art of computer programming 1, 3rd edn. Addison-Wesley, Boston (1997)","edition":"3"},{"key":"23_CR8","unstructured":"Russel, S., Norvig, P.: Artificial intelligence, a modern approach (2003)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Kurant, M., Markopoulou, A., Thiran, P.: On the bias of BFS (Breadth First Search). International Teletraffic Congress, ITC 22 (2010)","DOI":"10.1109\/ITC.2010.5608727"}],"container-title":["Communications in Computer and Information Science","Information Intelligence, Systems, Technology and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19423-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T03:31:44Z","timestamp":1553398304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19423-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642194221","9783642194238"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19423-8_23","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}