乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:57Z","timestamp":1725558957675},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_12","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"142-153","source":"Crossref","is-referenced-by-count":1,"title":["Decremental Clique Problem"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Grandoni","sequence":"first","affiliation":[]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09(3), 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"12_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press\/McGraw-Hill Book Company, Cambridge (2001)","edition":"2"},{"key":"12_CR3","unstructured":"Debruyne, R.: A property of path inverse consistency leading to an optimal PIC algorithm. In: European Conference on Artificial Intelligence, pp. 88\u201392 (2000)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Italiano, G.F.: Fully dynamic transitive closure: Breaking through the O(n2) barrier. In: IEEE Symposium on Foundations of Computer Science, pp. 381\u2013389 (2000)","DOI":"10.1109\/SFCS.2000.892126"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Italiano, G.F.: Fully dynamic all pairs shortest paths with real edge weights. In: IEEE Symposium on Foundations of Computer Science, pp. 260\u2013267 (2001)","DOI":"10.1109\/SFCS.2001.959900"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Italiano, G.F.: A new approach to dynamic all pairs shortest paths. In: ACM Symposium on the Theory of Computing, pp. 159\u2013166 (2003)","DOI":"10.1145\/780542.780567"},{"key":"#cr-split#-12_CR7.1","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set (2003);","DOI":"10.1016\/j.tcs.2004.05.009"},{"key":"#cr-split#-12_CR7.2","unstructured":"To appear in Theoretical Computer Science"},{"key":"12_CR8","first-page":"202","volume":"1","author":"C.D. Elfe","year":"1996","unstructured":"Elfe, C.D., Freuder, E.C.: Neighborhood inverse consistency preprocessing. In: National Conference on Artificial Intelligence\/Innovative Applications of Artificial Intelligence vol. 1, pp. 202\u2013208 (1996)","journal-title":"National Conference on Artificial Intelligence\/Innovative Applications of Artificial Intelligence"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights. In: European Symposium on Algorithms, pp. 320\u2013331 (1998)","DOI":"10.1007\/3-540-68530-8_27"},{"issue":"4","key":"12_CR10","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the Association for Computing Machinery\u00a048(4), 723\u2013760 (2001)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1006\/jcom.1998.0476","volume":"14","author":"X. Huang","year":"1998","unstructured":"Huang, X., Pan, V.: Fast rectangular matrix multiplication and applications. Journal of Complexity\u00a014(2), 257\u2013299 (1998)","journal-title":"Journal of Complexity"},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM Journal on Computing\u00a07(4), 413\u2013423 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"King, V.: Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In: IEEE Symposium on Foundations of Computer Science, pp. 81\u201391 (1999)","DOI":"10.1109\/SFFCS.1999.814580"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"King, V., Sagert, G.: A fully dynamic algorithm for maintaining the transitive closure. In: ACM Symposium on the Theory of Computing, pp. 492\u2013498 (1999)","DOI":"10.1145\/301250.301380"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence\u00a08, 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences\u00a07, 95\u2013132 (1974)","journal-title":"Information Sciences"},{"issue":"2","key":"12_CR17","first-page":"415","volume":"26","author":"J. Ne\u0161et\u0159il","year":"1985","unstructured":"Ne\u0161et\u0159il, J., Poljak, S.: On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae\u00a026(2), 415\u2013419 (1985)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Shoshan, A., Zwick, U.: All pairs shortest paths in undirected graphs with integer weights. In: IEEE Symposium on Foundations of Computer Science, pp. 605\u2013615 (1999)","DOI":"10.1109\/SFFCS.1999.814635"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Zwick, U.: All pairs shortest paths in weighted directed graphs - exact and almost exact algorithms. In: IEEE Symposium on Foundations of Computer Science, pp. 310\u2013319 (1998)","DOI":"10.1109\/SFCS.1998.743464"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T22:17:21Z","timestamp":1685657841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}