{"entities":{"Q6859667":{"pageid":20654635,"ns":120,"title":"Item:Q6859667","lastrevid":84252980,"modified":"2026-05-14T05:49:13Z","type":"item","id":"Q6859667","labels":{"en":{"language":"en","value":"Heterogeneous blocked all-pairs shortest paths algorithm for clustered weighted graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8158527"}},"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":"Q6859667$1C1E25D9-694F-498E-B604-491C62B88354","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5460b1f6a8214732088ffdbaeaed8d58d3edd3b3","datavalue":{"value":{"text":"Heterogeneous blocked all-pairs shortest paths algorithm for clustered weighted graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6859667$98AA2F59-F364-4083-BFC5-9416BDC31229","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"eb409891eff0b8c9cfca1750504667bc8adec5de","datavalue":{"value":{"entity-type":"item","numeric-id":6859665,"id":"Q6859665"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6859667$5D63D9F7-DC8A-418A-BD9F-1FABC8587931","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d22098fe1a3cc9f083949f9d07ca2a4d5ef33236","datavalue":{"value":{"entity-type":"item","numeric-id":6859666,"id":"Q6859666"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6859667$AFDEE4D8-680D-4DEF-9FD5-988490F303EA","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"9287278596468f2c5150699c9317a8659ad607b7","datavalue":{"value":{"entity-type":"item","numeric-id":6641461,"id":"Q6641461"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6859667$1284A147-E920-4A77-82C4-2D2E4C30CC76","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e00449ee46ca36ad03059afad45d439bb3ef6a85","datavalue":{"value":{"time":"+2026-02-11T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6859667$A7F615D5-53C2-4DBE-B88F-7A07BB075145","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"b6986106f321c5ec80d36422e6c5795f07f8b157","datavalue":{"value":"https://journals.bsu.by/index.php/mathematics/en/article/view/7156","type":"string"},"datatype":"url"},"type":"statement","id":"Q6859667$3613F352-6292-4531-BEE3-5101222BDA59","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6859667$FE8ADA58-2352-4A7D-B3AF-813E56FFBE58","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b2773d305bb22ed635d748bc939993c6750608ab","datavalue":{"value":"05C22","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6859667$E60C9699-2F95-4D7E-81E2-D0C32A0998FC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f3a5e47548ef139717b317f83801cfef606a623d","datavalue":{"value":"05C38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6859667$2E1CBFDB-1ED6-4468-B356-641DE0A8B425","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6859667$256FBE69-704B-4E17-B12E-0F1B17133E3A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"194e29a06fc2f71dcd85bdea4d5545aabe722edc","datavalue":{"value":"8158527","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6859667$8E9A4211-EC87-4541-ADA8-010F79CFA093","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"bee1ddd2bb542a0e64ca96574e4fab1bba361385","datavalue":{"value":{"entity-type":"item","numeric-id":57074,"id":"Q57074"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6859667$9BE0A24A-233D-476A-B266-CC726F35349F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"02253c9326ab7d7852dca0fa2588096a278a9909","datavalue":{"value":"clustered weighted large graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q6859667$8E5B541A-FD44-4748-951F-30D463E5CF7F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2e0c2303c7afac3ef811c6c760e0d3430d915f6d","datavalue":{"value":"all-pairs shortest paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q6859667$EF27AE3B-E132-4C67-916F-A8B92D894148","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1e7100337ff9bfa29d3dde4735c4acd7edb8c5f2","datavalue":{"value":"blocked algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6859667$D8E95D38-9000-44A6-8DB4-68D940790FB5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cf5f2151b713ed57ca3184ffd62e83392d6d1c99","datavalue":{"value":"heterogeneous computations","type":"string"},"datatype":"string"},"type":"statement","id":"Q6859667$5AF6E1CC-8213-4CA8-892F-3E2463B03F40","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"edf6802105c7189d078ee28d809d45f0e611cc09","datavalue":{"value":"speedup","type":"string"},"datatype":"string"},"type":"statement","id":"Q6859667$95B28D67-9B60-4318-A181-6E7A0E544EFB","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":"Q6859667$2F0C2114-C572-4248-880D-CD6B0ECE3969","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"dc873f67f71309601ab9fa2ae6984b33ce00e37e","datavalue":{"value":{"entity-type":"item","numeric-id":6669658,"id":"Q6669658"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6859667$E48BDD4F-C2E8-4DAB-93B1-9D0DCF1BCBD3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"a6315d9cda93162c2aba33a1d3e5ec00f12fd74a","datavalue":{"value":{"entity-type":"item","numeric-id":5729523,"id":"Q5729523"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6859667$CBDFE0BA-83A6-4360-9711-A2A08C60ABF9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f93ad2566cb99ad60ba2efa4fed1f2916f9cab9f","datavalue":{"value":{"entity-type":"item","numeric-id":5463439,"id":"Q5463439"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6859667$8DEFC37C-519A-41C1-B802-8EEA957C31B5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Heterogeneous blocked all-pairs shortest paths algorithm for clustered weighted graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Heterogeneous_blocked_all-pairs_shortest_paths_algorithm_for_clustered_weighted_graphs"}}}}}