{"entities":{"Q1367256":{"pageid":1377996,"ns":120,"title":"Item:Q1367256","lastrevid":70257384,"modified":"2026-04-13T13:32:16Z","type":"item","id":"Q1367256","labels":{"en":{"language":"en","value":"An efficient P-D algorithm for shortest path problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1063733"}},"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":"Q1367256$FC7AEFA9-52CF-4082-BB1E-D4BE3ADCA8D3","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7e92c3f9070f02b3b667919fd8d86f458aec10c8","datavalue":{"value":{"text":"An efficient P-D algorithm for shortest path problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1367256$B9ACA681-26E6-4E0F-9062-0CA0B3BA28DC","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"68cafc1cdafb8409cc0c766c1f3a54f29b43a96a","datavalue":{"value":"1043.90554","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1367256$8426E1CD-07FE-4D30-A233-BEB8D438F066","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"63a8d0ba838606d670716528505ce2d274744683","datavalue":{"value":"10.1007/BF02015143","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1367256$AB62EEF7-BE4C-496F-9F58-5CE73E4107F4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"03ca60a25dd4cc7651980d092288cabd14832a72","datavalue":{"value":{"entity-type":"item","numeric-id":1367254,"id":"Q1367254"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1367256$515CED96-AC49-4733-8436-335A21FB9270","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7c566302f1efc38ed158997b8844a68e4d08bbb6","datavalue":{"value":{"entity-type":"item","numeric-id":1367255,"id":"Q1367255"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1367256$076E7436-4EF9-4D5C-A4A3-B1C1694E5278","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"bd8a7678534b4c4a434a737b8e34eefad997d7a4","datavalue":{"value":{"entity-type":"item","numeric-id":176689,"id":"Q176689"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1367256$ED1DBE82-6F02-46F6-9643-E5495127CB7F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1742a10e6409607193ef806e8f573a0e208ec887","datavalue":{"value":{"time":"+1997-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":"Q1367256$AB27CEDF-B0A4-44FF-BD43-7DAA1FAA7D06","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1367256$287C421E-F7CB-4E66-89A6-314DEDC6562C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c8f2af7af438a822f3916c49dbbdd7b6ea6b98c0","datavalue":{"value":"1063733","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1367256$6D40EBD3-5833-4146-AF95-0067808DDF53","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":"Q1367256$99D2EA2E-B04E-4670-94B7-3F744A64E543","rank":"normal"}],"P223":[{"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":"Q1367256$B5F1D81D-1FFD-4CF5-A00B-04D3B455BE68","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"9ad86ed10f9dbc91aef6fdb78e5f6edf0ab2f5e6","datavalue":{"value":{"entity-type":"item","numeric-id":4739657,"id":"Q4739657"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1367256$B9EB15BF-9CED-41A7-9856-D1BB1EAAFD76","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"49308b1e0034e9584c579e0421111ba387485e11","datavalue":{"value":{"entity-type":"item","numeric-id":5519710,"id":"Q5519710"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1367256$8FB6ADFA-8D14-4779-9883-D84E0742159A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f89b589701c7ddebd7f770e30244e765765a6d40","datavalue":{"value":{"entity-type":"item","numeric-id":3236245,"id":"Q3236245"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1367256$C9DBD91C-CE4F-42E4-A849-E970A21DF908","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"95efefe54c6df2fec9632108ffab5a88994c3e62","datavalue":{"value":{"entity-type":"item","numeric-id":3984276,"id":"Q3984276"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1367256$EEB25833-4F10-4F70-BFD7-03F5C260BB16","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An efficient P-D algorithm for shortest path problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_efficient_P-D_algorithm_for_shortest_path_problem"}}}}}