{"entities":{"Q2735294":{"pageid":2746033,"ns":120,"title":"Item:Q2735294","lastrevid":79364576,"modified":"2026-05-06T13:44:31Z","type":"item","id":"Q2735294","labels":{"en":{"language":"en","value":"An algorithm for seeking critical paths in overall planning graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1640301"}},"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":"Q2735294$1345B5AB-93B6-4EB2-AB89-112CB86CCAA9","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"fe10f98275a39ddffe87f63fa8b9c0bfb7531098","datavalue":{"value":"0979.05097","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2735294$3961CDB7-6938-46D7-8A13-8A10191E1D8D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"43c2ee220d163c5ec42d6ca3be953427cff4f206","datavalue":{"value":{"entity-type":"item","numeric-id":602457,"id":"Q602457"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2735294$6EAA5F09-8C72-47CD-BFB7-0D84C984099C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"33852883618ea4ea2ab01bad3d6f0ef7c461396b","datavalue":{"value":{"entity-type":"item","numeric-id":1652387,"id":"Q1652387"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2735294$F7A0999C-7EDE-45B5-9F39-6CF3F2DF9885","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"276e2d894f0afabd8d0b22409adff80c34d1ec81","datavalue":{"value":{"time":"+2001-11-04T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2735294$86E08599-53BE-4C6F-BC88-9ED21F5827E5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2735294$C1531B22-3721-44EE-A4BE-9EFF999DEF10","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f3a5e47548ef139717b317f83801cfef606a623d","datavalue":{"value":"05C38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2735294$91EFAEB5-5E03-47DA-A930-7F293DAE568E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"62e010fd02e65f935649d1243c0aca19018292bb","datavalue":{"value":"1640301","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2735294$24FA57D3-C2ED-48A0-8544-10A195D1E936","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"48ddf43eca498c7e7087cd696beb82ea63925320","datavalue":{"value":"algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q2735294$41AF393C-5794-407D-AE6F-A267DC0E4CCB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0859b734e57871b10b2955fa9f611b26170b05b5","datavalue":{"value":"critical paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q2735294$F9B49B5E-B60F-4323-A6C8-D96CE66A543A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a1e24b226ad6bd0d13d1ee9b063ec41e5c2904de","datavalue":{"value":"overall planning graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q2735294$E41B4DB5-D526-4A66-9576-E675B910714E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"267b394071cf1b5b643cd515aabcdbcae8c08f98","datavalue":{"value":"polynomial complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q2735294$3B5BD443-B9DF-4ACC-A771-F54FE04BEFD6","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":"Q2735294$0392AC47-E6F2-4CE1-8BAF-F868ADD429EF","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b8aa183cd871a24d63fbaa3b534610a6db641763","datavalue":{"value":{"text":"An algorithm for seeking critical paths in overall planning graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2735294$C6ECBF52-4FF2-46D1-A4E9-F60B80B68AEE","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"560e679e99385a63b08412eadc1546f698f88102","datavalue":{"value":{"entity-type":"item","numeric-id":6768063,"id":"Q6768063"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2735294$D7A12E9D-6E15-4B05-8DCC-19CCCE03ED22","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for seeking critical paths in overall planning graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_for_seeking_critical_paths_in_overall_planning_graphs"}}}}}