{"entities":{"Q6081672":{"pageid":13215979,"ns":120,"title":"Item:Q6081672","lastrevid":102333683,"modified":"2026-06-06T04:12:36Z","type":"item","id":"Q6081672","labels":{"en":{"language":"en","value":"The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7746201"}},"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":"Q6081672$90EAD994-887F-4D07-BCE0-692AC7D217A5","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c959860f0d4f7e4afea495ba55961aa1997fd7d5","datavalue":{"value":{"text":"The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6081672$0FCB627A-66E6-479A-9C4C-5495ECB99040","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8a71b35bfe78c083c5542eb55288ad28ab575796","datavalue":{"value":"1521.05086","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6081672$333D8E4C-3305-4728-BACF-0750E1EF229E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ce4bbe90144c948adf7a99129ad6d4ea2c61c6c3","datavalue":{"value":"10.18255/1818-1015-2022-4-372-387","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6081672$5159382E-AA41-4EFD-AE0C-935F8091A043","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"78371a437aa9984914a77559b2a79a9a112beb25","datavalue":{"value":{"entity-type":"item","numeric-id":5866344,"id":"Q5866344"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081672$D9907FE0-A9B1-4064-BA97-1E9D784AEA82","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"5e4ff69d98581f0e60171b74a0d3744b7741d0e6","datavalue":{"value":{"entity-type":"item","numeric-id":5060051,"id":"Q5060051"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081672$50DD3AEA-FF18-42C1-BC59-6477148CC7E7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9f55db8f25bec7e5ca848d508ad8d2103ce52305","datavalue":{"value":{"time":"+2023-10-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6081672$9D9BD3D4-EFAE-4F54-BE3C-98E6C4E880F8","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"130a992891c2b03aa2a0f4a4cb20244c5aa3fe3f","datavalue":{"value":"http://mathnet.ru/eng/mais786","type":"string"},"datatype":"url"},"type":"statement","id":"Q6081672$2D083FD6-BB4A-4C4E-B990-65D96609A3C2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f3a5e47548ef139717b317f83801cfef606a623d","datavalue":{"value":"05C38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6081672$2A343493-E413-4761-9B0F-DD07E5380DAD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6081672$4D357E78-D775-4DCF-9D07-D4C0F9C69572","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6081672$C6548C84-01F8-4C05-81D6-2F51D7E0B25C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"eca12388cd97c6ec6a5289ed8d225f0a597e18fc","datavalue":{"value":"7746201","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6081672$F56F379D-9D77-4ECB-BAC8-7DF6B770DF0F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"22c68c639a23a2adb7d88cea667344078e33ef49","datavalue":{"value":"multiple graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q6081672$1DFDE2CF-8011-47E9-9E35-7312740F5044","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"af34df78cb191925fbc3b6e158d14c2168ab5c68","datavalue":{"value":"divisible graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q6081672$BE04FCDF-4FD1-46CA-AD66-D92FCFC50C29","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a7cc4847f945a7cf2dfeb8d1c296c0c1c781a296","datavalue":{"value":"multiple path","type":"string"},"datatype":"string"},"type":"statement","id":"Q6081672$3F1DC54D-A751-49A7-AB9A-DF67558C6FB1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f85e9f2721221f48af2e899508349c71e3faa29f","datavalue":{"value":"shortest path","type":"string"},"datatype":"string"},"type":"statement","id":"Q6081672$C77781B3-7DBB-4AB0-9DE1-F13C3BD1F459","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3bffca71a435ced51db72e4cc2c3e4d6cb1b9197","datavalue":{"value":"reachability set","type":"string"},"datatype":"string"},"type":"statement","id":"Q6081672$F5C7C596-A0E6-4D90-834C-6E12FF86CA7B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fc544e482aa599702c82d69a25709014b297742d","datavalue":{"value":"polynomial algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6081672$E3AF9AD6-5F59-444D-8196-B86B1E1A29BA","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":"Q6081672$3CF747A4-E3C1-4F64-B7F6-B16107BCD991","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"0d6f2edbac392a401db78b3255d1796b660a898d","datavalue":{"value":"W4311837466","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6081672$08784729-8CCD-4B2B-AED4-F6623621FF00","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"9194e9b150f8488fef979658da21ddd0e60751fc","datavalue":{"value":{"entity-type":"item","numeric-id":3651735,"id":"Q3651735"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081672$3DA3E16F-0AA5-469F-805F-2348F38D5390","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"9dc47122f6da99057e2203f2befd9ed00159db9c","datavalue":{"value":{"entity-type":"item","numeric-id":5668821,"id":"Q5668821"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081672$0F8277C3-E18F-48F1-854D-91DE523AD2BB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c87a6f5fb85f130f4d54d602898bd604df27a65d","datavalue":{"value":{"entity-type":"item","numeric-id":857879,"id":"Q857879"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081672$D0BE3967-C98A-4349-9EC8-D4DD92BE422A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3544ff5c3325f5ac1e5dcd2fd92020bf1b6189fb","datavalue":{"value":{"entity-type":"item","numeric-id":3292914,"id":"Q3292914"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081672$EA740817-F399-404A-8E0E-FF31B8629E1C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"bb92220ecaeaf6e79221575131f65d886e06b84e","datavalue":{"value":{"entity-type":"item","numeric-id":2136168,"id":"Q2136168"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081672$82EA1D2C-72DE-4EE1-B017-D2121F999737","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2b989f45b85fa44137ad22092706b6102fd241bf","datavalue":{"value":{"entity-type":"item","numeric-id":78129,"id":"Q78129"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081672$1E8E2BE8-3B27-48C6-8034-254D758A06C7","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081672$106A9B6A-DB3F-4C81-B708-F8F66FEF56FB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_Polynomial_Algorithm_of_Finding_the_Shortest_Path_in_a_Divisible_Multiple_Graph"}}}}}