{"entities":{"Q1280281":{"pageid":1291031,"ns":120,"title":"Item:Q1280281","lastrevid":70063866,"modified":"2026-04-13T12:11:16Z","type":"item","id":"Q1280281","labels":{"en":{"language":"en","value":"A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1261187"}},"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":"Q1280281$E67815E5-B811-4EA4-B70F-5676E490D901","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5c4bbd532263b0300990325f3edc2276c8d9b688","datavalue":{"value":{"text":"A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1280281$BB2C3587-0E55-40BA-B7DE-FCB649F4AC5B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"631baf58e0efb64e82a31eb7f6dc2c622cec953c","datavalue":{"value":"0914.90110","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1280281$349C459B-10DF-48C5-B51D-C77D92A84A31","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"148a2f146249ab09c883cf0600b6ccad6fce1be0","datavalue":{"value":"10.1007/PL00009811","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1280281$8A565F96-E7CD-4DD8-938E-2CC3C576D45C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"746535ddb96ae77c4a55cf2874e59b3bf4f00d57","datavalue":{"value":{"entity-type":"item","numeric-id":171928,"id":"Q171928"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1280281$7424068D-7CF2-40E5-924C-BCB9BB2F197A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"60eb2392c3cbb67419a7505eb4d7770437782b61","datavalue":{"value":{"entity-type":"item","numeric-id":187130,"id":"Q187130"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1280281$74C6B4EC-BBBF-41D1-9B2F-552BD3D8D94B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"14fc360ec3034cf7b4974dd2757eb533d1dfaac7","datavalue":{"value":{"entity-type":"item","numeric-id":423889,"id":"Q423889"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1280281$479F6EF8-F161-4E52-8C0B-1B3A1EBB6ED2","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a87e84d22579e69c48ca0a6d828473db4dde3dd6","datavalue":{"value":{"entity-type":"item","numeric-id":168579,"id":"Q168579"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1280281$4C068587-4CC1-4986-9018-050C39D4110A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5ccb0389d49d9dccc22d89b86cf8dea63356eb4b","datavalue":{"value":{"time":"+1999-03-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1280281$99CAB0DB-B982-4FC2-9A02-56B5941A4E4B","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"b3a0e14afe6eeac79da670c12ebe47c919a44a3f","datavalue":{"value":"The paper concerns the problem of finding the maximum flow between two terminals in a network \\(N = (G,T,c)\\) consisting of an undirected graph \\(G=(V_{G'}E_{G'})\\), a subset \\(T\\) of nodes of \\(G\\), called terminals, and a nonnegative integer - valued function \\(c: E_G\\to Z_+\\) of capacities of edges of \\(G\\). A free multiflow is a collection of flows between arbitrary pairs of terminals such that total flow through each edge does not exceed its capacity. Special networks \\(N\\) as inner Eulerian network, laminar locking problem, and inner balanced directed network are defined. The paper presents three algorithms: an algorithm for finding an integer maximum free multiflow in an inner Eulerian network, an algorithm for the laminar locking problem and an algorithm for balanced networks. For each of the proposed algorithms the complexity analysis is given.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1280281$DDE8C997-EA2B-4189-B71D-E3A29CF5EE17","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1280281$1EDA75BF-1F07-47F3-8C30-0D632384EDC1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1280281$29B9E794-7629-44E9-9181-F7320C77BEB2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1280281$664C53EB-F66A-4EB6-BF06-C1677782DB8A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a075736dd24125fb22e78e1f01acbe15d48baf3f","datavalue":{"value":"90C60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1280281$73A5BE35-C4E1-41B9-89E9-3059584088FA","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b51e74bd023d0f9e2c8cafa5bb466506b521bddd","datavalue":{"value":"1261187","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1280281$0B289227-BB1C-4689-BA1E-831861D6EAE6","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"db7efbbd7bf6469fee1ab4c817bc190d815a73c6","datavalue":{"value":"combinatorial programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1280281$91B042CD-135E-4975-82DB-451285AB9551","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f32d4a1d018dceab52f3ba66e904db90572a4744","datavalue":{"value":"flows in networks","type":"string"},"datatype":"string"},"type":"statement","id":"Q1280281$29C33B94-2524-4EFD-BEA0-E5EE30AEE089","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4f92b4fd71bec3fc4974e2d9f7d4be0eeff081e5","datavalue":{"value":"inner Eulerian network","type":"string"},"datatype":"string"},"type":"statement","id":"Q1280281$D97F18DF-205D-47FB-8CFC-8FAE915D72C9","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"32b61be5a8579cbff56f3ae053504391f67cfee3","datavalue":{"value":{"entity-type":"item","numeric-id":587430,"id":"Q587430"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1280281$57923967-3115-44AB-A873-B4F513E3C33C","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":"Q1280281$DFCCF852-16AC-4A2D-A7D1-DE41BBA0347D","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"e65337a89d01ff62c7d3ebf7c076579c501a79c8","datavalue":{"value":"https://doi.org/10.1007/pl00009811","type":"string"},"datatype":"url"},"type":"statement","id":"Q1280281$D8D8C2B4-66BA-4B61-8833-CDECD2DF7821","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"33b3e56963081f034addace004f0fbb23f9de13e","datavalue":{"value":"W2069968725","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1280281$EFE91AA6-601D-491F-9BC2-DB0505576671","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"28c2b5b68723ef7004043238d14eb29daca3cc7f","datavalue":{"value":{"entity-type":"item","numeric-id":2381535,"id":"Q2381535"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"77db1af80223434ef538c620d70f530d170d22e7","datavalue":{"value":{"amount":"+0.8567185997962952","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":"Q1280281$7FD9D518-2EB0-4805-8278-6C983E1C125A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"14e027e69dc99781c208712f6820f70a91d1cb62","datavalue":{"value":{"entity-type":"item","numeric-id":1080357,"id":"Q1080357"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b829a5435b3915f3c95c5c980f2bdf33fb6ff609","datavalue":{"value":{"amount":"+0.7888808250427246","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":"Q1280281$73662DBE-359D-48D0-B489-06ABA23B92C8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"11c5a6e237238343a21678739489afe23a6ca065","datavalue":{"value":{"entity-type":"item","numeric-id":1864616,"id":"Q1864616"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5d6baf0974ae0b90b0e6ea7998c1fb39082e2a0c","datavalue":{"value":{"amount":"+0.7864295840263367","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":"Q1280281$2187AE71-6235-4F8B-A6E5-4AFD8FA00D0A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"b4b478c31ac552de72157c80cf3af4f9c4b69fcc","datavalue":{"value":{"entity-type":"item","numeric-id":1085773,"id":"Q1085773"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ca8ca1d0a97dcd94d7f384f3bcfad8d07a1a0a38","datavalue":{"value":{"amount":"+0.7824766039848328","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":"Q1280281$FF262857-D04A-4A97-9642-5816A4CB8062","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1674d23c836523566927ea61b68ca505c6adbddf","datavalue":{"value":{"entity-type":"item","numeric-id":3541080,"id":"Q3541080"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"43214744489e2a9f346cba0af427e0413f0bb733","datavalue":{"value":{"amount":"+0.7815476059913635","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":"Q1280281$575F01D4-C85D-4428-92A0-AC2BC19F53B4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_fast_algorithm_for_finding_a_maximum_free_multiflow_in_an_inner_Eulerian_network_and_some_generalizatons"}}}}}