{"entities":{"Q1075769":{"pageid":1086521,"ns":120,"title":"Item:Q1075769","lastrevid":66792714,"modified":"2026-04-12T12:53:19Z","type":"item","id":"Q1075769","labels":{"en":{"language":"en","value":"An O(log n) algorithm for parallel update of minimum spanning trees"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3952027"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075769$55A7B5E5-FE1D-468A-87EC-CCDF50327AA1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"35021154144bbecb87629870134611510c93ae77","datavalue":{"value":{"text":"An O(log n) algorithm for parallel update of minimum spanning trees","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1075769$172F769B-395E-43F8-A0C0-78EA6EBEF3E1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"e409c8c124ac8f5edd04d41087b486ec974ba0c9","datavalue":{"value":"0592.68061","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075769$357AF6EE-68D7-4E57-A7E6-851600D17039","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"52ec7d2326bc53a57f3317a7107b239ab83f44b6","datavalue":{"value":"10.1016/0020-0190(86)90098-0","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075769$9AD8CC6B-8B23-4DB2-9FF4-E6E23A901BC9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"778fa1065527b41117b384448e05e152064c441b","datavalue":{"value":{"entity-type":"item","numeric-id":689095,"id":"Q689095"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075769$A9568F43-103E-4723-86B6-9A3EBEAA0BAA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bbc5e6deae886df457144401fa832a4f68f01b60","datavalue":{"value":{"entity-type":"item","numeric-id":1108034,"id":"Q1108034"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075769$02670388-2B3F-4B87-ABA8-68FC320C2499","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075769$C1472CD1-6D60-45BC-A768-B9539EC41F10","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"63df7153432d81fa42019fcabb076c89649b0b5b","datavalue":{"value":{"time":"+1986-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1075769$36C76A78-95B8-4A0F-B0C2-69663477ECA5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075769$2C3A0BFE-84DA-420D-BF98-EBFBBC53EAAF","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"192fd2dcf239557d130e2d0badc198d1e6b7c50e","datavalue":{"value":"3952027","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075769$7986FA3D-42A5-44AC-A0D2-1A873260E67F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7a38b11968d7cb86be0842b661cd5bdd713115f5","datavalue":{"value":"graph algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1075769$52B2EAAF-14B4-4E17-8F33-6ECB981CC3E1","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075769$09F2A2B6-8349-4E59-A483-B64FE29AF482","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"9c81fbb4196f8c60dead832055a6457d44f4c516","datavalue":{"value":"https://doi.org/10.1016/0020-0190(86)90098-0","type":"string"},"datatype":"url"},"type":"statement","id":"Q1075769$E930C3A8-CCF7-4BE8-B9B9-A2D1A417FDC7","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"fbe08e37d83a118b45f6016fa44b15612a5f7ffc","datavalue":{"value":"W2080566336","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075769$DE53FADC-60B5-49B6-A982-2D017453876F","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"7a6e5a64720179074df19a9ed557fe2c1a7ec358","datavalue":{"value":{"entity-type":"item","numeric-id":1247334,"id":"Q1247334"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075769$6F0B3C5F-F1E8-4F79-A829-6E09C601C43A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"1d56623f78492bf07b017885847d9f962019d9a8","datavalue":{"value":{"entity-type":"item","numeric-id":1075769,"id":"Q1075769"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075769$828B1779-C4A0-4895-A485-CA9EB369650F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3b3dce3552dfbea64412441f1ced1f652d688fa0","datavalue":{"value":{"entity-type":"item","numeric-id":3932299,"id":"Q3932299"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075769$3D11EEE8-8C09-4F4F-BB35-CF3651674B1D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"0b6d9185fe63e47253765971cbfec2e931ba065d","datavalue":{"value":{"entity-type":"item","numeric-id":4088854,"id":"Q4088854"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075769$527D6111-1137-4410-9ECD-4A386FE4785B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e5df19fdc79e639fa6b04eaaae6c2bf3cdb41c8b","datavalue":{"value":{"entity-type":"item","numeric-id":3335006,"id":"Q3335006"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075769$EE38D52B-ABE3-4E23-9B99-A86979F851B1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"39ca3e015d5a9a71c43e5d072fe10aa2d6bf2145","datavalue":{"value":{"entity-type":"item","numeric-id":4747506,"id":"Q4747506"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075769$0167721A-77E2-4B72-A06A-AD9CD6FA6FBF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An O(log n) algorithm for parallel update of minimum spanning trees","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_O(log_n)_algorithm_for_parallel_update_of_minimum_spanning_trees"}}}}}