{"entities":{"Q6828254":{"pageid":15109465,"ns":120,"title":"Item:Q6828254","lastrevid":56007778,"modified":"2026-02-24T13:04:16Z","type":"item","id":"Q6828254","labels":{"en":{"language":"en","value":"Time-space trade-offs for computing Euclidean minimum spanning trees"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7293351"}},"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":"Q6828254$2B6720B1-7FB1-4C21-B755-AD6BC3058A72","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6c593a860134ce43175a264de2a1291e0a1bdba6","datavalue":{"value":{"text":"Time-space trade-offs for computing Euclidean minimum spanning trees","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6828254$06440BB7-7288-49B3-B498-7295D0E39E31","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"925de31412fd104fc7d41bff9f04cbfaaa3d299b","datavalue":{"value":"1486.68202","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828254$24729CB8-990E-43D2-88F5-B50DD797CC02","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"dd2e0d7996b6a0afa2db49f78937b2a419cff95a","datavalue":{"value":"10.20382/JOCG.V11I1A21","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828254$F519E192-E8A9-4E3D-B2C8-CF00F3542910","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a4c6f3acb86cd097cedec91f06cd98706170424f","datavalue":{"value":{"entity-type":"item","numeric-id":2173454,"id":"Q2173454"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6828254$239C1F85-71ED-4452-ADC8-2EBFD698A0BE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b3279ad7512a965f4903ca463c4972140b36f0d1","datavalue":{"value":{"entity-type":"item","numeric-id":494796,"id":"Q494796"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6828254$411C8B9C-D7D0-4E98-BFA6-54C1850E77D0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8402804d132105b21de1e92dcac2c27db3304a01","datavalue":{"value":{"entity-type":"item","numeric-id":312141,"id":"Q312141"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6828254$94CB2DB3-08F1-4011-A76A-78E748258851","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"6bf5c5d23ad99853162b2f950960da9e0790bfbd","datavalue":{"value":{"entity-type":"item","numeric-id":6621708,"id":"Q6621708"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6828254$50E5E57C-2F38-4567-B61F-D9033BED5311","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1fa4914c42c2eeeba7e0ca739da9445f0abbea07","datavalue":{"value":{"time":"+2021-01-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6828254$0D355744-6406-446A-8E05-F9A9A0FBF01F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"159426a5937e62cfbbcc198dd4848ab52d6e715e","datavalue":{"value":"68U05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828254$977F1F2E-94BD-4235-A37A-0E411215ADAE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828254$84A07A67-E8C5-4376-9E3A-DEE581E9E969","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a7ddaa80bf0a693a36c1113ff6b7ad576f729940","datavalue":{"value":"68W40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828254$C063E1CB-05AD-4767-AA4E-0C607F6E7FAB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c957cbe7c564e58569922a560b5496f05213405e","datavalue":{"value":"7293351","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828254$C8DD4E41-17A6-444B-BFF2-6FD3E36CAF04","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":"Q6828254$0517BD4C-40DA-4773-AB6E-0FE93C49C429","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Time-space trade-offs for computing Euclidean minimum spanning trees (scientific article; zbMATH DE number 7293351)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Time-space_trade-offs_for_computing_Euclidean_minimum_spanning_trees_(scientific_article;_zbMATH_DE_number_7293351)"}}}}}