{"entities":{"Q2781538":{"pageid":2792276,"ns":120,"title":"Item:Q2781538","lastrevid":83237297,"modified":"2026-05-07T06:46:11Z","type":"item","id":"Q2781538","labels":{"en":{"language":"en","value":"An efficient \\(A^*\\) based algorithm for optimal graph matching applied to computer vision"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1721536"}},"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":"Q2781538$04E3DDEC-6F72-49C7-B223-53C36497E48A","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"9565bcde2515d6ffdb4c167f4610f41b0199482e","datavalue":{"value":"0995.68127","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2781538$281C7A5D-57E6-46F7-90F1-83E9705D3E82","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ceeaaff8b69097b37e53dba3e7b783d7c9d81f26","datavalue":{"value":{"entity-type":"item","numeric-id":2781536,"id":"Q2781536"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2781538$795923B6-D06A-4323-B40D-0B202AEAF4D7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"129bd7a5c0a0e194452e54bf41ab5ac0410e558d","datavalue":{"value":{"entity-type":"item","numeric-id":2781537,"id":"Q2781537"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2781538$DDDADC02-37BD-481D-8B22-A6F2CD63AAE7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3cc285ec7c5bc7b0feafd8a19bb46fb8985f229d","datavalue":{"value":{"time":"+2002-03-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2781538$F9DD5B17-DE88-4C35-BB78-219A6A133C4E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ebf0f2849b55956bfa4d8a6c8afd54fb9e567526","datavalue":{"value":"68T45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2781538$DA69AF1B-4B12-4578-9EAA-94E9051F1684","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ab7a0d2add14e0dbd91ec8ae1d32a5bb94f2fb34","datavalue":{"value":"68U10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2781538$6E8ADF87-E824-411D-9DDF-AE937C94C22C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"79b3bc872b6637176b35f9e46ac855febbf884f5","datavalue":{"value":"68W05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2781538$000715AF-B531-4808-8A7C-1336287932BE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"67d74d9bba77d6f60f021d3c2476f7cef002b584","datavalue":{"value":"1721536","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2781538$25C089BA-1327-438F-AF23-DD85FE7410E6","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0cd3d2c33ecc5fa87c975216844a43ff66233694","datavalue":{"value":"graph matching","type":"string"},"datatype":"string"},"type":"statement","id":"Q2781538$7A929EB0-807F-4948-8A5C-378AD041C5F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"74b096c67fcaacd1b41359c18118c52d080fb5fa","datavalue":{"value":"\\(A^*\\) algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q2781538$D61543F9-E4DF-4AB6-A792-033878921376","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6cc5918892b50010a90ee07fa121a8c66268a4b7","datavalue":{"value":"computer vision","type":"string"},"datatype":"string"},"type":"statement","id":"Q2781538$90CDE733-238E-4301-AF03-F36C5B725418","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":"Q2781538$10959CA9-9A49-45D0-B06C-8F9A6C6869A3","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0d9aef311ffc33c879cb82aff37cd94391abb512","datavalue":{"value":{"text":"An efficient \\(A^*\\) based algorithm for optimal graph matching applied to computer vision","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2781538$C2A98DB0-5E20-41C9-B542-AEC0639A468F","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"abdd28dc24d9c4c8064b8217cc4ce448fedbe7f2","datavalue":{"value":{"entity-type":"item","numeric-id":4808957,"id":"Q4808957"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"799b603d4bf6045914dd9b760015020672131210","datavalue":{"value":{"amount":"+0.7695221304893494","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":"Q2781538$D3701446-842B-4B75-B817-923603E771F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7e5aab62fd0c7c97778edfd6f9aecd63700f3afa","datavalue":{"value":{"entity-type":"item","numeric-id":5276648,"id":"Q5276648"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"7769776f961263b08b540bf41cd5f91465742291","datavalue":{"value":{"amount":"+0.7637802362442017","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":"Q2781538$CEE55942-FB8A-4858-A131-CC8D418159E9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7e4d8daa9944fe4817585c9e5175bc84a287d478","datavalue":{"value":{"entity-type":"item","numeric-id":4808922,"id":"Q4808922"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3cf77ccd617ca73c0e29a51eb812a32597b17a96","datavalue":{"value":{"amount":"+0.7543190717697144","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":"Q2781538$AAA79D1D-8CFA-4D28-9EF8-6E1E633CC1E6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e19b67465cf4ce3e842334123d8f6652bc1cfdf3","datavalue":{"value":{"entity-type":"item","numeric-id":5706014,"id":"Q5706014"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6f59ee1dac54fc7f6b88be050a8db1725cff94b4","datavalue":{"value":{"amount":"+0.7386592030525208","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":"Q2781538$DAC1C4A8-2AEE-4A7F-8A64-521DAC57B917","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"63c1009d959b5d47d3071d33a52969bf06cb5674","datavalue":{"value":{"entity-type":"item","numeric-id":3493248,"id":"Q3493248"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d72266129c4e54b7958b8f6027f93d4620fbbfe7","datavalue":{"value":{"amount":"+0.7315064072608948","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":"Q2781538$B1C96848-47EC-4B12-9F2A-BC22FF119476","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An efficient \\(A^*\\) based algorithm for optimal graph matching applied to computer vision","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_efficient_%5C(A%5E*%5C)_based_algorithm_for_optimal_graph_matching_applied_to_computer_vision"}}}}}