{"entities":{"Q1567071":{"pageid":1577811,"ns":120,"title":"Item:Q1567071","lastrevid":67979322,"modified":"2026-04-12T20:37:49Z","type":"item","id":"Q1567071","labels":{"en":{"language":"en","value":"Polynomial algorithms for a class of minimum rank-two cost path problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1455287"}},"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":"Q1567071$8CB2060C-FDC2-478A-BFA9-C5CFBD89F212","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"719aba3f13175e89aa76ea08de12a1072bc36964","datavalue":{"value":{"text":"Polynomial algorithms for a class of minimum rank-two cost path problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1567071$BEB9219E-4A7D-4770-A8E1-7DF84ACBBCEC","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b10a1e7f30454878e16a1c8b21971b3c334eba44","datavalue":{"value":"0961.90082","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567071$08DF0674-DF89-43CE-930D-930124E1221B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3561c9f04934bc9aab58356b452cd6bca02541c6","datavalue":{"value":"10.1023/A:1008372614175","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567071$5A11C090-ADF2-4C76-A820-FFFDC0A7A3A9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e524dff1db356dd4e0671258d6841fb8604b876d","datavalue":{"value":{"entity-type":"item","numeric-id":166212,"id":"Q166212"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1567071$3C894528-2C2E-466E-9E2B-66D6D1AA6138","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"8c9a1d032b4dee05705e8b2f4f60118816c12892","datavalue":{"value":{"entity-type":"item","numeric-id":116038,"id":"Q116038"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1567071$A04E6491-4CF7-48DD-AC32-6398352AF15E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b296ecc9fb2c30a514c2239a7c726ce0b9568fb8","datavalue":{"value":{"time":"+2000-06-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":"Q1567071$866D5AB7-DFA3-46E8-B948-21EAA5FF9877","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed10a41ec587cb61dc683f25ef4b3e827c7fee2f","datavalue":{"value":"90C26","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567071$CEEB775C-C4D6-4563-B3B1-8BFD748F1CC6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567071$C9AB1FE9-67AF-4718-8477-E15D6A04186B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c6a6abcec684ef9fd3db76cb4d2cf682049b055c","datavalue":{"value":"1455287","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567071$E04A97BA-1C36-4AAA-A729-184B53BC7F31","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9c2df4be61b42c15be02a284667cc79d17284cd8","datavalue":{"value":"global optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1567071$C7DB9FD6-45E3-44BA-A7EF-37B2BAB229DE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7e062542eda111585837507462901f561dd78129","datavalue":{"value":"low rank monotonicity","type":"string"},"datatype":"string"},"type":"statement","id":"Q1567071$E99755AA-E4D6-40B9-B1B7-938B62344168","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fc544e482aa599702c82d69a25709014b297742d","datavalue":{"value":"polynomial algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1567071$3E56928B-C2A3-4DF3-93D4-151ADBBF151A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f85e9f2721221f48af2e899508349c71e3faa29f","datavalue":{"value":"shortest path","type":"string"},"datatype":"string"},"type":"statement","id":"Q1567071$AE801D8D-74A1-4016-8371-C455EFF131A1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e3765ba26d918d31a6ae723b9fc1074bd79fd207","datavalue":{"value":"Dijkstra's algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1567071$29D34EDF-464C-4F4C-813B-F8B55D5CDA44","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"207ae2fffc96f0b105ad18ce3d0478c26b38ad6a","datavalue":{"value":"directed path of minimum rank-two monotonic cost","type":"string"},"datatype":"string"},"type":"statement","id":"Q1567071$60E29426-8749-448B-B8B9-EA0699A32F61","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":"Q1567071$137C81B1-C101-4FCF-B7B3-EEF45A0D93D8","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"a756ee61aed2226dacaf5f7a7a5a118b66a039d0","datavalue":{"value":"https://doi.org/10.1023/a:1008372614175","type":"string"},"datatype":"url"},"type":"statement","id":"Q1567071$126FD14E-FDAC-4B84-8633-23D119039ACF","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"4db82dd9bf4a1be54cf00ffbfa2fa809c0d6e585","datavalue":{"value":"W125350291","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567071$B3B68CF5-6A28-49A5-B76B-CB820E8CB53E","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ac22ce0d2d598580750bed95cd5770a0910c4d0a","datavalue":{"value":{"entity-type":"item","numeric-id":4764587,"id":"Q4764587"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"67030a1e8b90ca62cca935f90a17513abab3b07b","datavalue":{"value":{"amount":"+0.7769955396652222","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":"Q1567071$2C34E4D5-B963-415F-95EE-96AD1E7541A6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a6b63b6c0582433dd5a83393943e64fb1ed4fcc2","datavalue":{"value":{"entity-type":"item","numeric-id":4845159,"id":"Q4845159"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e41450f3ac3c83338f0dd6f7ace93c69894e3e56","datavalue":{"value":{"amount":"+0.7651051878929138","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":"Q1567071$ACEEE0DC-765F-4C7F-ACD1-1D9E53919D07","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8269607914302cb544d3c9ee94982c62f922b62a","datavalue":{"value":{"entity-type":"item","numeric-id":1804581,"id":"Q1804581"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d2eadd994ce97cf5b111ae18d7571e699beeca41","datavalue":{"value":{"amount":"+0.7638264894485474","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":"Q1567071$4C185E00-B0AD-44F4-A705-44721BEE5CC1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8301bb64a8c6ad9d57bd148de9a7636ba894e12e","datavalue":{"value":{"entity-type":"item","numeric-id":5288156,"id":"Q5288156"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b2ce9c344a8a5d1343513e1d6259d26effae8084","datavalue":{"value":{"amount":"+0.7613070011138916","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":"Q1567071$017BE203-6517-4C58-A392-C50BF8AA7047","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Polynomial algorithms for a class of minimum rank-two cost path problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Polynomial_algorithms_for_a_class_of_minimum_rank-two_cost_path_problems"}}}}}