{"entities":{"Q3882476":{"pageid":5912381,"ns":120,"title":"Item:Q3882476","lastrevid":88879082,"modified":"2026-06-04T15:43:24Z","type":"item","id":"Q3882476","labels":{"en":{"language":"en","value":"Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3687399"}},"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":"Q3882476$FDCE1715-DC68-412B-878C-54C54CF0B3D9","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ded5fb677a78c986049d93ac5758f99f993204f9","datavalue":{"value":{"text":"Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3882476$4563FC4D-FFC4-4B23-BAA5-506218F9165A","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"1141bb31e1d1f97a2d19562e6214cfced0ae247c","datavalue":{"value":"0441.05017","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3882476$445E1A9A-2402-4B85-A602-48BCD5FB7822","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"46b4cb0f7639b67cc1caeb8abbb76ce82161968e","datavalue":{"value":{"entity-type":"item","numeric-id":851893,"id":"Q851893"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3882476$4F39A254-1F24-4621-8377-E22A03B932EF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0edcd7fa1cf993d9e6287bc7de764d8ad7909fff","datavalue":{"value":{"entity-type":"item","numeric-id":3882475,"id":"Q3882475"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3882476$46CA02A3-934C-4821-879A-575165451961","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"e65e5835af9de26707f74dfee72aee1cd18dbebb","datavalue":{"value":{"entity-type":"item","numeric-id":3025760,"id":"Q3025760"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3882476$DE60ECA5-8C95-45F2-BDB9-2C676C7002C3","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"56afe75e154439409929c71e0e459d1542811b6e","datavalue":{"value":{"time":"+1980-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":"Q3882476$6F9ADB91-46A5-45E7-AB09-F84C2B1CBC92","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f0d1683dc539e8d2a37b0615ea6222a71b0b65bc","datavalue":{"value":"05B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3882476$EEA6C36A-3088-4087-A5D9-087F7F6ABAAA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3882476$24AE2764-6BE0-44D5-88C5-ECB4FC95BE66","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"83bbf0b299346afb89579c3d6a26f4aedc76938a","datavalue":{"value":"05C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3882476$9E44A4F8-48E9-49B5-BAE0-6A2645E24CD3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3882476$8CC92277-B6D1-4D18-ACF1-3D56FFC6B251","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7149d9c645e943bc0356ead4a756a6d3d82ced70","datavalue":{"value":"3687399","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3882476$FC79B769-830F-4B62-845E-C1690662F3C9","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0a98fdc415b871902bf310caee2992f6f1b91c39","datavalue":{"value":"travelling salesman problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3882476$3DDA2EE3-ED9E-49D7-9FA5-59425F3EF381","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c30be8786a3d9c6a5fe85b81c32abe9fa5b2898a","datavalue":{"value":"peripatetic salesman problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3882476$474BB7C5-63C9-491F-8A44-752C53B234C5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"771d937db3cc3e653ec7e55a6c37658d408618a6","datavalue":{"value":"minimum weight base","type":"string"},"datatype":"string"},"type":"statement","id":"Q3882476$43A9ABB5-D286-4F8D-83C8-EFDD3E33089A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e172629663780e971698d7d841046893adba3be5","datavalue":{"value":"matroid","type":"string"},"datatype":"string"},"type":"statement","id":"Q3882476$14570578-3722-48BA-B5FE-CC6CBA3CC883","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bab71d1679a0534be10fa3fec82a9c0e1813b9c4","datavalue":{"value":"Greedy algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q3882476$C33546B5-2A2A-4D19-88ED-ABF2B46876A5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8492362146b232473140762e4eb450db7e5af4a5","datavalue":{"value":"Hamiltonian circuit","type":"string"},"datatype":"string"},"type":"statement","id":"Q3882476$1CDB48A1-D064-49AB-A0E1-089199C8FAB8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"732e1592c53acfd9740f2cb8680bbb91fda5b0af","datavalue":{"value":"minimum spanning tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q3882476$D6B30AFE-3E08-42FB-8723-BADB29F77B86","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":"Q3882476$DAB649E0-9CBC-4034-9A19-971D2269652B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"89478ed527b68d1c6d40d4670b8af27e048d34aa","datavalue":{"value":"https://doi.org/10.1007/bfb0120910","type":"string"},"datatype":"url"},"type":"statement","id":"Q3882476$03AA5DFC-31A3-400B-970C-72D8518D812E","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"3be3a21e62cffcb4a7d12b7f274ca2ec5af289f2","datavalue":{"value":"W173428383","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3882476$A090D611-72B6-482C-89A9-4DEF1DDCA869","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"1043851e3deed6703a24faf5d991ad79c1da9666","datavalue":{"value":"10.1007/BFB0120910","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3882476$0F66EFC1-5AC6-4C59-B9BB-68421E5804BB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory","badges":[]}}}}}