{"entities":{"Q7361601":{"pageid":31520342,"ns":120,"title":"Item:Q7361601","lastrevid":105367655,"modified":"2026-10-07T13:37:15Z","type":"item","id":"Q7361601","labels":{"en":{"language":"en","value":"Relational Minimum Spanning Tree Algorithms"}},"descriptions":{"en":{"language":"en","value":"AFP entry Relational_Minimum_Spanning_Trees"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"dfbc4bc14e7f0b15bba408da5fe9ff473ed900c8","datavalue":{"value":"https://isa-afp.org/entries/Relational_Minimum_Spanning_Trees.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361601$5BAA4AA2-EF63-4B96-BDE4-24A589CBCA9F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5a78190d4c8adc255c405de184aa517737c3fe83","datavalue":{"value":{"time":"+2020-12-08T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361601$E79ECA27-2A2D-4790-8A6D-DA7D115DE606","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"3c617235e619eef98fa14e39d518bd5dd86d6a82","datavalue":{"value":"Walter Guttmann","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361601$7BB7E229-8971-4CE5-A5F3-51B845ADCE65","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"9905418d26948473e78c9cc8967c54329e210e37","datavalue":{"value":"Nicolas Robinson-O'Brien","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361601$7C5AD1E6-757A-416B-A6AE-4F1E3D395F48","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"af5747fae9d7e3e6906adeca63c6b3dd33340ced","datavalue":{"value":{"text":"Relational Minimum Spanning Tree Algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361601$5FF9F4C4-D513-4CEB-A354-ACC5F26A0543","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"c3074941946b08f05391631e7142b21f2bcad359","datavalue":{"value":"We verify the correctness of Prim's, Kruskal's and Bor\u016fvka's minimum spanning tree algorithms based on algebras for aggregation and minimisation.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361601$690C36FA-CE1B-4ABA-900B-FF4010B50B09","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"e1875abaece1d66ddaba10921601fc6a862c8e6e","datavalue":{"value":{"entity-type":"item","numeric-id":577987,"id":"Q577987"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361601$2B235EBF-E28B-42D4-9DC6-6B9A3C545AB7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b51ea257c0c789966c28caebb09ed1d044d2dd25","datavalue":{"value":{"entity-type":"item","numeric-id":4779256,"id":"Q4779256"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361601$982C5FCB-6A28-4634-A876-B963592FE204","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3bef23118bf98d63fdbb00d06eb4b6e716d89399","datavalue":{"value":{"entity-type":"item","numeric-id":3179390,"id":"Q3179390"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361601$45B2C635-04F6-43FC-8622-0B9D51EF31F8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b81951e897710188eb28a701280cdee54aef3bd0","datavalue":{"value":{"entity-type":"item","numeric-id":1786562,"id":"Q1786562"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361601$7E273AFE-4755-43A8-A440-7565C7A9AC98","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d4f1737076dc313cc8310424628d232438f7012e","datavalue":{"value":{"entity-type":"item","numeric-id":1994364,"id":"Q1994364"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361601$4AD08C0E-9781-425B-990D-84724CE11B22","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"1b2dd397e6a6cf4d03acac1069f23f8962b690f5","datavalue":{"value":{"entity-type":"item","numeric-id":5936015,"id":"Q5936015"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361601$26CE3CCC-81B3-4C78-A564-88FB997AC250","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361601$466BD29C-B088-4646-A343-E44A1694EED2","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"ba4fcd3a8ed2931015b20f6e6a36463ed6bb4301","datavalue":{"value":{"entity-type":"item","numeric-id":7361036,"id":"Q7361036"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361601$D7D3711D-F6E8-4B5E-88C3-DE9842B67DE4","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"0cb214ba14504ce52502380598f813a3d010fff5","datavalue":{"value":{"entity-type":"item","numeric-id":7360777,"id":"Q7360777"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361601$C94707E8-3454-4E2A-8359-27BB7A6D3C26","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361601$EDEF00E1-E444-4E03-8931-94A36B87FC1D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Relational Minimum Spanning Tree Algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Relational_Minimum_Spanning_Tree_Algorithms"}}}}}