{"entities":{"Q2770116":{"pageid":2780854,"ns":120,"title":"Item:Q2770116","lastrevid":83192675,"modified":"2026-05-07T06:34:28Z","type":"item","id":"Q2770116","labels":{"en":{"language":"en","value":"An \\(O(nm)\\)-time network simplex algorithm for the shortest path problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1702826"}},"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":"Q2770116$64B5603B-88B0-452E-833D-FDC9BAC2E055","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"97a0efeae0d28bf944d3daeeeb9cfcc17c53ebe8","datavalue":{"value":"0979.90116","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2770116$9E36F113-73DC-49D5-8FB6-FE020AAE2006","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"389c681e6859e96625810538dab4d8964ec9e5f5","datavalue":{"value":{"entity-type":"item","numeric-id":233995,"id":"Q233995"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2770116$9989F730-A908-462D-86BA-5D54DC7A23A1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"69bd49faf55a6dca11b8020ec5596702ab11101c","datavalue":{"value":{"entity-type":"item","numeric-id":233996,"id":"Q233996"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2770116$BF62519D-C460-42D2-B8CA-825A9D5F1B8C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"da22dd798edb52cb4cd38ece3d93e1b6b18670dd","datavalue":{"value":{"entity-type":"item","numeric-id":71781,"id":"Q71781"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2770116$1A48B8BA-DFBE-4C40-9E21-612BF9B15FF6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a58c0c334590fe3ab2e759e1b681637074ea80c2","datavalue":{"value":{"time":"+2002-02-07T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2770116$25C5447D-FB3E-48AA-82B3-86ED7C4D70B0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2770116$61D14ADC-B76F-4306-9EEF-C3B4E9AC1125","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"63b70ec5cb69f5c5c9550409918141ca28bfae61","datavalue":{"value":"90C08","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2770116$CFC86917-4981-49E4-A035-D0BE77BCB59F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5b137c231c8041dd4d10ad6bd3645867b7f0a055","datavalue":{"value":"1702826","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2770116$52370A98-9EF1-4DC0-8EAF-578A05A07078","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"69d0c99f1e5283b31715a9c7d799852fe62c506e","datavalue":{"value":"shortest paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q2770116$3E2D5160-3C4F-44A9-8725-BC1FCFD99ED4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"46a901287fbfb36953e755ba9144eb8d86b7ab3b","datavalue":{"value":"network simplex algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q2770116$95C183AD-BE75-4A6B-BDD0-A41F4A62C7CB","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":"Q2770116$748413D7-C8A2-4E67-B09A-3CEE1D9DE60A","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"6fd82e827942c1129ea366eed92d9c252e0fbeec","datavalue":{"value":"https://doi.org/10.1287/opre.47.3.445","type":"string"},"datatype":"url"},"type":"statement","id":"Q2770116$0D10A8BA-C3EA-4A1C-BEFF-AD16083F7D08","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"c706e1f1acc9a08fe264f5d03ab3459beb0dd709","datavalue":{"value":"W2099123195","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2770116$E44BD630-EC13-4CAA-AC22-E83D6D6BC1D2","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9c58192e9ab635b219a7dbd8497b8e707aef951a","datavalue":{"value":"10.1287/OPRE.47.3.445","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2770116$871A23EF-A57A-4B49-BFDC-A73433C724C6","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"83112d2d4dba87c529a6f470ccbb96357faafee0","datavalue":{"value":{"text":"An \\(O(nm)\\)-time network simplex algorithm for the shortest path problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2770116$118D0264-0DE2-4B1D-8402-0543C1CA4272","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e85be131891b402ccf56b99ef80cdb46955540cc","datavalue":{"value":{"entity-type":"item","numeric-id":5202040,"id":"Q5202040"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d68355136861679b522a8b9701b18b942faca168","datavalue":{"value":{"amount":"+0.8657983541488647","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2770116$5F3F61E3-5561-4EA0-91F9-CE4383318C11","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3272207c266f6a1c47665c8935486b36e605647a","datavalue":{"value":{"entity-type":"item","numeric-id":4367972,"id":"Q4367972"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1eabecac17a366250f7bccf31d69e43b07200fd4","datavalue":{"value":{"amount":"+0.8302525281906128","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2770116$C2130055-0828-49C4-8AAB-A5FFBC47E09F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"da2020d34b82ab6b5500820009f86ec4d1f9be70","datavalue":{"value":{"entity-type":"item","numeric-id":3990557,"id":"Q3990557"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"574fd504711376ce28218ee9d5e237b57ddaa346","datavalue":{"value":{"amount":"+0.829767644405365","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2770116$D9CD7405-02E5-4896-A75E-EAEDFE7DB09F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0574879d053cfeb969ac26563c465b0eaeb04473","datavalue":{"value":{"entity-type":"item","numeric-id":1373742,"id":"Q1373742"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e48fcb32e21e21e9294a2fecf456ab71bff286f1","datavalue":{"value":{"amount":"+0.8237683176994324","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2770116$6E1D2662-82F6-4627-8EFC-39CF8DEDA4E9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"55a9912a6ee382308a6cd18f15e0c0f62750e531","datavalue":{"value":{"entity-type":"item","numeric-id":5479661,"id":"Q5479661"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"57f137e602a30427dac8f55a10048cf784217c13","datavalue":{"value":{"amount":"+0.8231649398803711","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2770116$4557421D-062A-43D7-95A8-CE0B662EC2AC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An \\(O(nm)\\)-time network simplex algorithm for the shortest path problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_%5C(O(nm)%5C)-time_network_simplex_algorithm_for_the_shortest_path_problem"}}}}}