{"entities":{"Q6909489":{"pageid":20958799,"ns":120,"title":"Item:Q6909489","lastrevid":75610078,"modified":"2026-04-20T08:56:35Z","type":"item","id":"Q6909489","labels":{"en":{"language":"en","value":"A divide-and-conquer algorithm for min-cost perfect matching in the plane"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8112186"}},"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":"Q6909489$B3A47795-BEAA-4CD1-BBA2-561B9BBA2ECD","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ea94bf9828ec583e205e55fa9036f4391683d91b","datavalue":{"value":{"text":"A divide-and-conquer algorithm for min-cost perfect matching in the plane","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6909489$7D8977B5-C2DC-4B49-91AD-F19C59EBB3C0","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b700f0ce354c8bb9418536799e04c8a33ae25caf","datavalue":{"value":"10.1109/SFCS.1998.743466","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909489$98FA38EB-1FA3-40F0-B2E0-BB161467CE7E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"cce85b4d0d7087c3d8e248a5cdb4c3b856fdb3b1","datavalue":{"value":{"entity-type":"item","numeric-id":590541,"id":"Q590541"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909489$3B47C285-1A01-40EA-A81F-B8FC0DF23FEC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b77d6a4382bc7a32fc14d82772e7dcb343e03ac6","datavalue":{"value":{"time":"+2025-10-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6909489$BC9096AF-5043-4394-876B-77F04704C92A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909489$C9698960-958D-45F1-BF8F-92EBFAC0D992","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"31061d295a0d6bc7adbb181be766a359735fdd84","datavalue":{"value":"8112186","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909489$0D1D8955-EC31-47C4-B0D6-6BD07A4487F2","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":"Q6909489$40855CB8-1F69-4B06-8A47-EFD63AB5DA28","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A divide-and-conquer algorithm for min-cost perfect matching in the plane","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_divide-and-conquer_algorithm_for_min-cost_perfect_matching_in_the_plane"}}}}}