{"entities":{"Q4608592":{"pageid":6638175,"ns":120,"title":"Item:Q4608592","lastrevid":82281692,"modified":"2026-05-06T20:31:53Z","type":"item","id":"Q4608592","labels":{"en":{"language":"en","value":"Faster algorithms for the maximum common subtree isomorphism problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6851866"}},"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":"Q4608592$7780FE0E-7BE6-4853-A864-4598A5AFC6AD","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"15160902d4c2cde4b541b2781532d4857dd9b42e","datavalue":{"value":"1398.05196","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4608592$DC54FE0C-1F60-4EA6-95E4-FCDF6054903A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"989a3fa100494cd47a8ac60f2d57e919b94b4e74","datavalue":{"value":{"entity-type":"item","numeric-id":2942615,"id":"Q2942615"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4608592$096241D6-34E2-40A9-B454-00D94DB1A4AF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"43736c3e33ca3c76f8b8388e84903bd812fcee27","datavalue":{"value":{"entity-type":"item","numeric-id":1670993,"id":"Q1670993"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4608592$9A4F7273-0F58-4EB8-800B-7E8F3D414E8E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5d2ef2e004dadf2280b1eb49c44b6969dc2a5533","datavalue":{"value":{"entity-type":"item","numeric-id":548666,"id":"Q548666"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4608592$9974182B-CFA2-45E7-BEEF-545D4C2B6FA2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7b370aaa83f4efe6143e52606b64b18fd663e7c7","datavalue":{"value":{"time":"+2018-03-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4608592$5DEFC88C-BB42-4571-9C4E-70A1B609AB58","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"0a5ddda40088c5000f77059c99bbe9bbb92c3029","datavalue":{"value":"https://arxiv.org/abs/1602.07210","type":"string"},"datatype":"url"},"type":"statement","id":"Q4608592$975F9602-E633-4181-BAB4-D9424C89BCE4","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4608592$22096969-9B7E-45B6-A80B-E82B9C13C214","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4608592$34AB44CD-C2EF-4F2F-9C7A-EA5E8820E2AB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1de0493fc6f7fe4361a54e7c2f5546e4ec52adf0","datavalue":{"value":"05C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4608592$7A4A3F9E-8126-4640-81CF-55958D75F561","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"2e742a171e2cc4a4f154f55124e2a34e0da3eb3e","datavalue":{"value":"05C60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4608592$D04B15CC-6B8A-45C0-8EE9-196F8FE0091C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4608592$25B51C17-E7D1-405F-9F5D-BA83C4014621","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"8e3390a8bdd1e782b07761b63c86c72c5dd95c1a","datavalue":{"value":"6851866","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4608592$1C324F50-F81E-4EA8-95AE-71034D6F35C4","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"362933aec6547e862ae5513f6d13f5e1645c7c5a","datavalue":{"value":"MCS","type":"string"},"datatype":"string"},"type":"statement","id":"Q4608592$BFFB30D7-BF87-43F4-8046-A2B15196D2C5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"57132d20ba25938eabda321ea199ef1367c924c8","datavalue":{"value":"maximum common subtree","type":"string"},"datatype":"string"},"type":"statement","id":"Q4608592$2DF8675A-42F6-4C53-B5D3-C2FD693ABE48","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5679bed385f2291640f42aea7c87183c58362105","datavalue":{"value":"enumeration algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q4608592$B9EBF978-2C89-44B0-892A-CF26FF3AB4DA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0d4066ecabb7cec3f89f9ae60b056545185dbca8","datavalue":{"value":"maximum weight bipartite matchings","type":"string"},"datatype":"string"},"type":"statement","id":"Q4608592$E2B6C349-93AC-44E5-969E-24D7FC65F328","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":"Q4608592$822C5649-6204-4C68-A65A-DC64CC3D36D8","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ea5dbe1205539831ada9b2de80bde5c8a7079f3c","datavalue":{"value":"10.4230/LIPICS.MFCS.2016.33","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4608592$D5FF73F1-D2B4-4E56-9CAC-D68F25D588B2","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"febcc6a2d0941c675016642ef3991142360bed57","datavalue":{"value":{"entity-type":"item","numeric-id":2942616,"id":"Q2942616"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c7a70c12d2bb10afb766c158136eb3aa4f93dae3","datavalue":{"value":{"amount":"+0.900930404663086","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":"Q4608592$A3FDB737-79F3-412F-A14D-E82F8F548EA9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d7fe33c3281961c5c8e0c00850da7e6b85d85bbd","datavalue":{"value":{"entity-type":"item","numeric-id":2348030,"id":"Q2348030"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d48115c0973c5c92e1b0192349f7b52c268ad2e5","datavalue":{"value":{"amount":"+0.8514161109924316","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":"Q4608592$07279B4F-72A3-4F1F-BD1B-57C76ECA6C6B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ddaa43ff349f0caabc4b21cfa01d4f7c97c01de1","datavalue":{"value":{"entity-type":"item","numeric-id":4935309,"id":"Q4935309"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"887831a9f2e7cb1a7d4a0eaaa097ea2a322bd71d","datavalue":{"value":{"amount":"+0.83897465467453","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":"Q4608592$7D962B12-15A3-4F85-9F3A-87AE04913657","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a3c25a3e9613f2e22e34b77fd3d43bf2ec829613","datavalue":{"value":{"entity-type":"item","numeric-id":2842767,"id":"Q2842767"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f70c9e2e7b406579490856a2cd9502facd440af1","datavalue":{"value":{"amount":"+0.8341084718704224","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":"Q4608592$80A97686-C424-4A43-AEBC-09D14748BE1A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6197b09cbd7425989a36acc852f11b1e7c767ee9","datavalue":{"value":{"entity-type":"item","numeric-id":5712135,"id":"Q5712135"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"19a1008ce245a2ead27b779934ed06473e81d3f3","datavalue":{"value":{"amount":"+0.824872612953186","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":"Q4608592$B998FD17-6F0C-4681-A6C4-6056CE4228EE","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Faster algorithms for the maximum common subtree isomorphism problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Faster_algorithms_for_the_maximum_common_subtree_isomorphism_problem"}}}}}