{"entities":{"Q1186308":{"pageid":1197057,"ns":120,"title":"Item:Q1186308","lastrevid":66798219,"modified":"2026-04-12T12:55:19Z","type":"item","id":"Q1186308","labels":{"en":{"language":"en","value":"A matching algorithm for regular bipartite graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 36442"}},"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":"Q1186308$18F74D36-3002-413B-8625-467DFF5798D3","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"50baf479c0427141bda372ebe956696b3aab64a8","datavalue":{"value":{"text":"A matching algorithm for regular bipartite graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1186308$75B97E11-1031-4CA1-83DC-EDAAB502F290","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"fa9b4173fd374c4e3fe3f70c0fdf9a2d93c28c8b","datavalue":{"value":"0752.68061","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1186308$1E0A33EF-4479-41BA-B80D-6916C4198681","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"a72f7bf4cd7989d5331aec8367cb44a642c6e8eb","datavalue":{"value":"10.1016/0166-218X(92)90244-5","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1186308$B1E2EFEC-DA2E-40E1-903C-10D3332C6A0F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d66991c28e328b3453f258d6f8e9b035f341f7c4","datavalue":{"value":{"entity-type":"item","numeric-id":1307852,"id":"Q1307852"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1186308$5385350B-4455-42BD-BFAE-AF49C8671EF0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"201364cbbc61e0d0a85431778d2e1c2e76306b69","datavalue":{"value":{"entity-type":"item","numeric-id":6480584,"id":"Q6480584"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1186308$7C2CBC87-FBD1-4508-8062-F726FB86DC3E","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087f55844cc920aae060b09644168bf17b022e1a","datavalue":{"value":{"entity-type":"item","numeric-id":96294,"id":"Q96294"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1186308$FC686622-63A4-476A-97C2-51B3D93D09FE","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"120787504bea9565def539fb4bfb19084956028b","datavalue":{"value":{"time":"+1992-06-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1186308$A3B788D1-1EAF-49D2-A348-2530718ECD6D","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"980df25e3260cc71cced7b3da79c096d0657547f","datavalue":{"value":"An algorithm for finding a perfect matching in \\(r\\)-regular bipartite multigraphs is given which uses \\(O(n^ 2 r\\log r)\\) time and \\(O(1)\\) space.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1186308$F3D7EB4C-0CBF-4207-84E9-C5323AE57FC6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1186308$42629E03-582F-4708-B8F4-299A20F0E339","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1186308$506A153A-93E3-4305-B127-FF90D87AD8D7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4260652c1c86b8ccbb403b19b3230fdf5a02a9fb","datavalue":{"value":"36442","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1186308$ABC0DD8E-07D5-4E22-B759-C536D202FDC4","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"eecb173004633ca38efc326bcd073800d8b745c9","datavalue":{"value":"bipartite graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1186308$154E83F4-4012-4462-9E93-09FDAD3166C8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"19ec132a1ede33f50fb04fa222303f9cda249a50","datavalue":{"value":"perfect matching","type":"string"},"datatype":"string"},"type":"statement","id":"Q1186308$F28BA1D8-20AF-45EA-8543-C3C25519E063","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"c666ac2d78f9f2d8ad99cfc32edd5f33e6fa3ff8","datavalue":{"value":{"entity-type":"item","numeric-id":287186,"id":"Q287186"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1186308$FECC2FC1-0800-4DC7-8233-A77BB1E74C9B","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":"Q1186308$D897F7FA-ABC8-4552-A03E-8984AC7C2E5D","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"a156e0662bc83b6e0756fe5911ba53732735c1a8","datavalue":{"value":{"entity-type":"item","numeric-id":2547591,"id":"Q2547591"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1186308$43BAC1F4-D8E4-4A6B-AD9D-0CD392AE8AF9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"fd41a3d3ffce78a856861213ff6553c14d782cc0","datavalue":{"value":{"entity-type":"item","numeric-id":5904119,"id":"Q5904119"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1186308$B2B5E09D-2295-458F-A4F9-D053559A4DC2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"242f6732c9aecb9180d76230dd0b3ce80be5a4cb","datavalue":{"value":{"entity-type":"item","numeric-id":4130999,"id":"Q4130999"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1186308$CD68961B-9A3A-4E78-B767-505DBD4CFA8A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ac0ec4868dba1b37d1adb8bb9f6a23d6c0a862f5","datavalue":{"value":{"entity-type":"item","numeric-id":3880849,"id":"Q3880849"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1186308$659C3625-D249-4196-A68F-CBC6836E3BF3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"20560673347fa07753fe40599896f4c6b70ef341","datavalue":{"value":{"entity-type":"item","numeric-id":1088987,"id":"Q1088987"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1186308$3CBDA71B-9092-4C9B-A7D3-21AFBF6A0B8A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A matching algorithm for regular bipartite graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_matching_algorithm_for_regular_bipartite_graphs"}}}}}