{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:51:12Z","timestamp":1725501072690},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_46","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T05:49:24Z","timestamp":1189748964000},"page":"516-527","source":"Crossref","is-referenced-by-count":8,"title":["Lower Bounds on Edge Searching"],"prefix":"10.1007","author":[{"given":"Brian","family":"Alspach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Hanson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"Alspach, B.: Searching and sweeping graphs: A brief survey. Combinatorics 04 (Catania, 2004) Matematiche (Catania) 59, Fasc. I\u2013II, pp. 5\u201337 (2004)"},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Seymour, P.: Monotonicity in graph searching. Journal of Algorithms\u00a012, 239\u2013245 (1991)","journal-title":"Journal of Algorithms"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Fellows, M., Langston, M.: On search, decision and the efficiency of polynomial time algorithm. In: 21st ACM Symp. on Theory of Computing, pp. 501\u2013512 (1989)","DOI":"10.1145\/73007.73055"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/333979.333980","volume":"47","author":"M. Frankling","year":"2000","unstructured":"Frankling, M., Galil, Z., Yung, M.: Eavesdropping games: A graph-theoretic approach to privacy in distributed systems. Journal of ACM\u00a047, 225\u2013243 (2000)","journal-title":"Journal of ACM"},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BF02992395","volume":"31","author":"R. Halin","year":"1967","unstructured":"Halin, R.: Unterteilungen vollst\u00e4ndiger Graphen in Graphen mit unendlicher chromatischer Zahl. Abh. Math. Sem. Univ. Hamburg\u00a031, 156\u2013165 (1967)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"issue":"2","key":"46_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L.M. Kirousis","year":"1986","unstructured":"Kirousis, L.M., Papadimitriou, C.H.: Searching and pebbling. Theoret. Comput. Sci.\u00a047(2), 205\u2013218 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"46_CR7","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A.S. LaPaugh","year":"1993","unstructured":"LaPaugh, A.S.: Recontamination does not help to search a graph. Journal of ACM\u00a040, 224\u2013245 (1993)","journal-title":"Journal of ACM"},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S.L., Garey, M., Johnson, D., Papadimitriou, C.H.: The complexity of searching a graph. Journal of ACM\u00a035, 18\u201344 (1988)","journal-title":"Journal of ACM"},{"key":"46_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J. Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphes. Coll. Math.\u00a03, 161\u2013162 (1955)","journal-title":"Coll. Math."},{"key":"46_CR10","first-page":"281","volume":"15","author":"Z. Tusa","year":"1990","unstructured":"Tusa, Z.: Exponentially many distinguishable cycles in graphs. Graphs, designs and combinatorial geometries (Catania, 1989). J. Combin. Inform. System Sci.\u00a015, 281\u2013285 (1990)","journal-title":"J. Combin. Inform. System Sci."},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1007\/978-3-540-28648-6_140","volume-title":"Algorithms and Computation","author":"B. Yang","year":"2004","unstructured":"Yang, B., Dyer, D., Alspach, B.: Sweeping graphs with large clique number (extended abstract). In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 880\u2013892. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:17Z","timestamp":1619519297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}