{"entities":{"Q1836479":{"pageid":1847221,"ns":120,"title":"Item:Q1836479","lastrevid":73885800,"modified":"2026-04-14T17:37:16Z","type":"item","id":"Q1836479","labels":{"en":{"language":"en","value":"On the worst case of a minimal spanning tree algorithm for euclidean space"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3797181"}},"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":"Q1836479$59C8BE39-97E3-4FA0-9D98-24BBBC38DB7B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c7d097a3e8430d083fb0b984c46a05dae645f896","datavalue":{"value":{"text":"On the worst case of a minimal spanning tree algorithm for euclidean space","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1836479$DDB92AFA-476A-41A8-B983-C1C450E9A22E","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"033158127a9f171b90a271677c6cfb5608ba9113","datavalue":{"value":"0505.68029","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836479$77BEB4FF-2441-4076-8FA7-54B5E3239F99","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"355377ca8bf1d95199d35be027f54549f6e25621","datavalue":{"value":"10.1007/BF01937321","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836479$D785E02C-EC1D-42B7-BA59-428E338E4508","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"2fe70195d1e0d46d568646f1bb894a0f78708017","datavalue":{"value":{"entity-type":"item","numeric-id":396691,"id":"Q396691"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1836479$9D22269A-F7AA-49ED-917F-880A51CCD226","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"e560271c921b84b65a9b7f0d3fa6830623f8af8b","datavalue":{"value":{"entity-type":"item","numeric-id":188629,"id":"Q188629"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1836479$CDA1150E-CD45-41C4-A0C4-D24CB9ACDCF2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0136733d5dd7d9f4d36f24c87a0b8375ae1cb2fd","datavalue":{"value":{"time":"+1983-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":"Q1836479$6FF3CB0B-EF25-45EC-8C13-76C99C8E56CD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836479$31E3B3C8-6477-4B10-97E3-EB4C9D7A2ADA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836479$2BAD9032-E736-455D-8666-4979FA5BA355","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b470d8897ac8adb7a6391a0dde353d7c5d4c690a","datavalue":{"value":"3797181","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836479$11B28ECE-4097-4719-A46B-748309688B46","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4ec3f4fd10bea585e3fc2ce376cc8f18aab8cbf5","datavalue":{"value":"23, 2-8 (1983)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1836479$71FC3CC7-5779-49A4-B75D-7B1FD9E18D48","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f91d56e5acb4506ea9b26c645bc38bd22da7b68e","datavalue":{"value":"worst case running time","type":"string"},"datatype":"string"},"type":"statement","id":"Q1836479$0389F09E-0AD3-4197-BF3B-3534E3795761","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6078fceba255c2f14830c9cbf81b3ab69e83b898","datavalue":{"value":"minimal spanning tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q1836479$EB4596FC-38BB-4B87-852A-FD72531F5312","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":"Q1836479$E95244C5-AF45-4ED0-BFBF-9A4D9D7C160E","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"e39540c82f8c30016c3e4a5730fc8255b57ae793","datavalue":{"value":{"entity-type":"item","numeric-id":4146251,"id":"Q4146251"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1836479$BE985B0C-3A1A-4546-A850-32AD8264D1D0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ec3a5b933664f88237f6ffc73c6b3dcacd5daa28","datavalue":{"value":{"entity-type":"item","numeric-id":1154282,"id":"Q1154282"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1836479$7E226A03-591D-4429-8F3D-7102EB9D3AD7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the worst case of a minimal spanning tree algorithm for euclidean space","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_worst_case_of_a_minimal_spanning_tree_algorithm_for_euclidean_space"}}}}}