{"entities":{"Q6663029":{"pageid":14274186,"ns":120,"title":"Item:Q6663029","lastrevid":95977538,"modified":"2026-06-05T10:08:40Z","type":"item","id":"Q6663029","labels":{"en":{"language":"en","value":"An approximation algorithm for the exact matching problem in bipartite graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7966927"}},"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":"Q6663029$9D7CD2F0-CF0F-48D0-99F5-0102A4A11C41","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3add58b41f87d9197a7265fa383e3a3fef93216b","datavalue":{"value":{"text":"An approximation algorithm for the exact matching problem in bipartite graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6663029$807F4AC2-465C-4989-9282-157E9B449909","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6b3f377cdc64a1d13ccba820a1442c38644e9362","datavalue":{"value":{"entity-type":"item","numeric-id":2681402,"id":"Q2681402"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6663029$74662FFA-E28B-4751-8704-A03727BA89E5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a8d1423a364eb3e789dd19ef47573f97dff3aace","datavalue":{"value":{"entity-type":"item","numeric-id":6117030,"id":"Q6117030"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6663029$D1A2106B-D585-42AF-9885-0BFC33F78202","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7c0874f6b42e806167fb01791554afa13be53ba0","datavalue":{"value":{"entity-type":"item","numeric-id":1725761,"id":"Q1725761"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6663029$DE51976B-123D-45D0-94CD-6DF317DD6996","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b939f7d6bb04335f584ac4f12e27b7d35776737c","datavalue":{"value":{"time":"+2025-01-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":"Q6663029$4433A397-8C14-4595-93D0-1C6D06250141","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e01671c873d801b913451010c0981a684c101d40","datavalue":{"value":"68W20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663029$368362B8-C6EA-4AFA-8BC6-345B858AABC3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a4228d21095b3348e9ea20aa0b63610107aad8cc","datavalue":{"value":"68W25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663029$3534D8C6-249E-4C37-BD57-28006949FE8C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663029$62E25074-F6A4-49B1-94EC-FA737460FA09","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e26702bd119b55c7b0426b9e7d59bdd5775128c0","datavalue":{"value":"7966927","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663029$51D8110A-2CDD-4CE2-8163-4939D0CE9F27","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"19ec132a1ede33f50fb04fa222303f9cda249a50","datavalue":{"value":"perfect matching","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663029$5645CB7A-4224-4578-B998-CFDC1DA9BEAE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d64d417abe64438a0d4b000a806efa4f821c4235","datavalue":{"value":"exact matching","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663029$C66A0C27-3D8D-4030-BBDA-63389C51CC73","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3d6783cabc1d9ebfe1f0394916de8c78f2624655","datavalue":{"value":"red-blue matching","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663029$A01A5A7D-4A61-4EC6-A49E-B1EC6DF631B6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cc4837877785b4675d8ac1c6d4c911bcaf794e13","datavalue":{"value":"approximation algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663029$D091C77D-2D3B-4AE6-A8AE-F943E418C9E5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ee3f2709a37a9d7b3e63bc69cec3e6f343bbf711","datavalue":{"value":"bounded color matching","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663029$747DD02C-D6CB-49BC-9279-EF3E5D1FD3E3","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":"Q6663029$92B644B3-F562-4C89-9182-5E8425656AE6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9a5bcb77a68ecc7d9af9311d01cf5b82ec2cefb2","datavalue":{"value":"10.4230/LIPICS.APPROX/RANDOM.2023.18","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663029$D8BFB5C8-DAB2-40A4-8308-F775A20CA6BF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An approximation algorithm for the exact matching problem in bipartite graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_approximation_algorithm_for_the_exact_matching_problem_in_bipartite_graphs"}}}}}