{"entities":{"Q6081679":{"pageid":13215986,"ns":120,"title":"Item:Q6081679","lastrevid":102333746,"modified":"2026-06-06T04:12:36Z","type":"item","id":"Q6081679","labels":{"en":{"language":"en","value":"Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7746209"}},"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":"Q6081679$6CAD7AAB-DCD2-45F2-822E-EF340E34534F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"eee4a419a71634616df5d099b3d620e4018ad86a","datavalue":{"value":{"text":"Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6081679$36E6556A-080A-4622-BC61-6D2047965BE6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"96f8005543ce114732ba8478cab2d36c2d73ba0a","datavalue":{"value":"10.18255/1818-1015-2023-2-128-139","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6081679$433B894A-4579-4308-BAAB-58CB762331E3","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"14fa8c27f2146801dd058355367d17926eae9c69","datavalue":{"value":{"entity-type":"item","numeric-id":5060055,"id":"Q5060055"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081679$3A9D78D7-8821-4F64-AE7F-D8BF4860E259","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"5e4ff69d98581f0e60171b74a0d3744b7741d0e6","datavalue":{"value":{"entity-type":"item","numeric-id":5060051,"id":"Q5060051"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081679$A60290BD-871A-4EC0-8D20-3DD9F5331B2C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9f55db8f25bec7e5ca848d508ad8d2103ce52305","datavalue":{"value":{"time":"+2023-10-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6081679$4F24C055-1BEF-48E4-A0FC-BD4148812B66","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"2c6f04c3bebe14758b27f6ad329bc05764c38f94","datavalue":{"value":"http://mathnet.ru/eng/mais794","type":"string"},"datatype":"url"},"type":"statement","id":"Q6081679$3BB0A44E-4E0E-4412-80E4-FC81325C757A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1de3565cfd3393000dd87ca545f95ff84d4c1446","datavalue":{"value":"68W10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6081679$1F0148ED-8CAD-4CAE-97A4-50B243162023","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2d99e00aed69bdbc23be738662914ece73b8a3f8","datavalue":{"value":"7746209","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6081679$80A21841-2DF7-4116-A5F2-8700E5F41571","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"eb1d35a2ecf73f0130b2a5d33ef40972a27b961d","datavalue":{"value":"maximum common subgraph","type":"string"},"datatype":"string"},"type":"statement","id":"Q6081679$52309067-BBC9-4925-96B5-B72617F24841","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ec3505d4a1a47ba6779c1bc97acbae985df00be0","datavalue":{"value":"isomorphism","type":"string"},"datatype":"string"},"type":"statement","id":"Q6081679$14A056F2-B4B1-4E14-9FEA-2C628DD2F1EA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0967c5f93d36d6aa18ee008d77ee288965d952b9","datavalue":{"value":"parallel algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6081679$481892C4-96EB-443A-B59A-F844E22D7F62","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0f796ed2b460346bbba92264dac0da22a5120d5d","datavalue":{"value":"recursion","type":"string"},"datatype":"string"},"type":"statement","id":"Q6081679$A2BAAEF5-6B57-443B-8F11-897C173182F2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"359cc99fe2e734d750c9477058ba26c6a8c28ba4","datavalue":{"value":".NET","type":"string"},"datatype":"string"},"type":"statement","id":"Q6081679$8BE77D3A-52BB-4959-9ECF-BC40C80C8BF4","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":"Q6081679$6D78D53F-6C7C-4225-BC6D-3923ECCF857B","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"b1f5632948a9df54c0c61a484dd47353d2411bbf","datavalue":{"value":{"entity-type":"item","numeric-id":3673102,"id":"Q3673102"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081679$2BCD5290-69B5-4B77-BEF7-4E0CB15DBF64","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"dbf7751af521c5a378d94f80ca8e8e61928a11ff","datavalue":{"value":{"entity-type":"item","numeric-id":5301407,"id":"Q5301407"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081679$0C5DC630-10AC-4BFF-9F1D-1019920BEF8A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"452cf654287c30a836f5bdfad01532dcd8a29e40","datavalue":{"value":{"entity-type":"item","numeric-id":3919094,"id":"Q3919094"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081679$A0DACEBB-12E9-43E7-B419-D96CEA300193","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"078e0a5ec559210a14a4145be98e18a1a255f6b1","datavalue":{"value":{"entity-type":"item","numeric-id":5677064,"id":"Q5677064"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081679$00F307D0-AB94-426D-8DD7-EC3F5AB9079D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"db36d637c12a95aef57ecaf0fff2febbcd9e761c","datavalue":{"value":{"entity-type":"item","numeric-id":5060056,"id":"Q5060056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081679$20E9A140-CF7A-4B9F-9C10-6759CB818E0B","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6081679$AF34845B-A720-486B-817B-3678080FB42D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Recursive-Parallel_Algorithm_for_Solving_the_Maximum_Common_Subgraph_Problem"}}}}}