{"entities":{"Q1836587":{"pageid":1847329,"ns":120,"title":"Item:Q1836587","lastrevid":70953165,"modified":"2026-04-13T18:28:14Z","type":"item","id":"Q1836587","labels":{"en":{"language":"en","value":"An O(K.n**4) algorithm for finding the K best cuts in a network"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3797467"}},"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":"Q1836587$3A95D4DF-6CA0-4765-A688-671912425DC7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8156b31b202ab2b3541fed6f9277483296518be9","datavalue":{"value":{"text":"An O(K.n**4) algorithm for finding the K best cuts in a network","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1836587$4CF0E97F-6679-472D-B6D4-FB1AF77F17A4","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"9ccaee8a5ebdceaa90be4281d6b3e3026db018c2","datavalue":{"value":"0505.90023","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836587$2BFC8521-880C-4783-BCAB-1D783BAF4B84","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b843c7aa881e67b8f3a83e4622ec4578531dcec2","datavalue":{"value":"10.1016/0167-6377(82)90037-2","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836587$A5892B2D-D025-496E-8AD6-A91A21B57992","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e50be6e020f540bbd257789357e2fcbd9ed3a74e","datavalue":{"value":{"entity-type":"item","numeric-id":166234,"id":"Q166234"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1836587$1CAD75A4-4740-4D1E-8F77-47C6AEB888AA","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f9747a37b0b56aeca2085282046e2737cd5087ca","datavalue":{"value":{"entity-type":"item","numeric-id":96289,"id":"Q96289"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1836587$757AC2CD-35E8-4325-8E57-9D753D553B4E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"47f57cd36df9e30d446df3867dc3917e4ea74654","datavalue":{"value":{"time":"+1982-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":"Q1836587$FB26FB2F-2371-48A6-AA46-7CA1A7B1E3CF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836587$D8A93D13-DF14-404C-A9F0-59BF51EF528E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836587$C8055B2C-80C8-400B-9B9D-F6286D53B3FF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836587$607F9BA7-101B-4279-9A9B-193C706B04CF","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"dfd1f2d0e2d8e88c6569d30f97421bd47c990892","datavalue":{"value":"3797467","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836587$C5065921-4104-498A-9B99-EFBC84C538E4","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"73720f4ba50fb945dc7717ace3487865f1ca2059","datavalue":{"value":"finding best cuts","type":"string"},"datatype":"string"},"type":"statement","id":"Q1836587$6FD07DB1-D983-4234-91DC-74B0CFC2969A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7b0110d8b80a9cb785b5e8849ed6bfee4173ae6b","datavalue":{"value":"flow algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1836587$42670499-B48B-4A44-976D-19018B7B56AD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1262d51f50334708902b19dcd78f24e1a994f9ba","datavalue":{"value":"cuts","type":"string"},"datatype":"string"},"type":"statement","id":"Q1836587$C17BE4CB-2B38-4911-9B0A-63B8ABD99A75","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"697e54e49a63d80ed4600319d8eedb733690b866","datavalue":{"value":"branching technique","type":"string"},"datatype":"string"},"type":"statement","id":"Q1836587$D6D90CC8-95C8-4157-BDD9-F7B57670A4F4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2ba0cc3f7aaac8445724ef309c9eecb57f5a563d","datavalue":{"value":"computational complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q1836587$7328AA52-7083-4659-B9EC-9479D81FAE1F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b6c428e594a65c875e2a5efb4fa93c56a7c89a76","datavalue":{"value":"finite directed graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q1836587$83DA95A0-40A9-49C8-99BC-E725B285FB57","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":"Q1836587$0825EA61-831E-448E-99E2-CF25E5FE3C35","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7141720c332096c3e3f91dac77b8504ed316506f","datavalue":{"value":"https://doi.org/10.1016/0167-6377(82)90037-2","type":"string"},"datatype":"url"},"type":"statement","id":"Q1836587$CE11AD70-FE3F-410E-AE59-51FA000C2DCE","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"e8b4230f966e7c4f08dfd9d43a106e9dec1ed10e","datavalue":{"value":"W2018639409","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1836587$726F42A5-0280-482A-ABBF-98B120193D0D","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"034cfe80e57a0ed3d2bb30b7fac411998868354e","datavalue":{"value":{"entity-type":"item","numeric-id":4116059,"id":"Q4116059"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1836587$CF21B2E7-1793-43EC-AB6D-0CC22583D454","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f0c5986e4e74df2a60288f4c7051532770972460","datavalue":{"value":{"entity-type":"item","numeric-id":3683848,"id":"Q3683848"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1836587$DB9F4257-6E2E-4248-9E6F-277E71A4902E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"bec7e3ed20b3cac9dff88ebdf5372d37a1366a36","datavalue":{"value":{"entity-type":"item","numeric-id":4058442,"id":"Q4058442"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1836587$A981DFF6-E02D-4EE5-899E-31CF484D0D5F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2d4fbbdb525d53e912d0fd9fc57d70ac9cc61edd","datavalue":{"value":{"entity-type":"item","numeric-id":5643805,"id":"Q5643805"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1836587$299EC4B0-AE6D-4157-8E03-25E372A1EBB6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An O(K.n**4) algorithm for finding the K best cuts in a network","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_O(K.n**4)_algorithm_for_finding_the_K_best_cuts_in_a_network"}}}}}