{"entities":{"Q2740491":{"pageid":2751230,"ns":120,"title":"Item:Q2740491","lastrevid":82912565,"modified":"2026-05-06T22:24:04Z","type":"item","id":"Q2740491","labels":{"en":{"language":"en","value":"On an algorithm of a generalized graph construction for digital device"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1646961"}},"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":"Q2740491$EC106673-30E2-48E7-A492-07332DC50465","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"daaf6e4d1651166e96dcf4afe0477de6940866fa","datavalue":{"value":"0971.94512","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740491$20D48BB2-825F-47BA-9710-6783F1B209C9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"855b836d837c19dd8db7cf2f7a9aeaff1cd401a6","datavalue":{"value":{"entity-type":"item","numeric-id":220211,"id":"Q220211"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2740491$1474ABA6-B3DE-4C67-822F-FD231F62AF64","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a033829ef6f0cf3809061d16fde5ff67c5d7e53f","datavalue":{"value":{"time":"+2001-11-02T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2740491$8E23BB76-298E-4BEB-9BA3-E3A05E21D527","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"effafbcb0d14f283a888b55b376e46f500ec447a","datavalue":{"value":"94C12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740491$FD11F71E-2F74-42E7-A238-8FDEE35BD482","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1e903e68a16880f66ed79a0863889f1b2d3c837c","datavalue":{"value":"94C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740491$E4ED69C1-6374-44E0-8B17-8DAE5CF82A7B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8d8a22ace48964288ca1ed080fca5299ff532395","datavalue":{"value":"68M15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740491$93F68941-8A02-4C87-9E75-C9511C029B76","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3f84cd73634e66285ad85b1179d49eb82591d942","datavalue":{"value":"1646961","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740491$DB333CA8-824E-4247-A714-9C6B18AABC86","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ddc14051a93e8c78a1da682d6f4184d91e9c6088","datavalue":{"value":"graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q2740491$F8C9344F-0EFD-4155-BD2F-E161DD6EFCD4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c510c56082c23c41d87d5de60f2a0300a8fcf613","datavalue":{"value":"digital circuit","type":"string"},"datatype":"string"},"type":"statement","id":"Q2740491$AB1D20DC-CF8A-4DEB-907E-5C7C3A85E146","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":"Q2740491$336BFA3F-F1B4-4D8A-9EF6-DA7DE3353044","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"af0e6cd69341ee1d6ed4bd1a67e1746e68fd7749","datavalue":{"value":{"text":"On an algorithm of a generalized graph construction for digital device","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2740491$E1A59F57-E88C-43B2-96DA-5D6551AAEF9A","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"c7f4cc04fcaa20fb1b72f843077f0fff94947d2b","datavalue":{"value":{"entity-type":"item","numeric-id":6768708,"id":"Q6768708"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2740491$25D2D523-AD2B-4D39-A5EC-FA3B44B010C2","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"7d601be03b772ae30e756717c9269f33004e4b30","datavalue":{"value":"An algorithm for the design of a generalized graph for digital device based on applying the attainable and contraattainable sets is presented. It is established that the most frequently used operations may be implemented only on the basis of standard fast computer instructions (and, or, compare, shift etc). The implementation resources of proposed algorithm depend rather on the length of computer words than on the order of the graph matrix.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2740491$16952F36-7CCA-44F4-9970-8EB772B14F9C","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"a883836726fb5f7be41f75195c71bf60ba06b063","datavalue":{"value":{"entity-type":"item","numeric-id":821296,"id":"Q821296"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2740491$A0B735E1-DA5A-4542-A9A8-B773AEB2F904","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"aada435847ee79d25373ac3527042f0d85b2b793","datavalue":{"value":{"entity-type":"item","numeric-id":5150506,"id":"Q5150506"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e1379df338a1e09fc6a12f6f94aece9a2044dd9b","datavalue":{"value":{"amount":"+0.7264844179153442","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":"Q2740491$B835B7CA-1B9E-4FB9-B291-38DA77D65990","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"918dd59253a11ee3905f796a988b7154db672ebe","datavalue":{"value":{"entity-type":"item","numeric-id":3338116,"id":"Q3338116"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"44246f80d43b3d16206fd8f43651ce350da2618a","datavalue":{"value":{"amount":"+0.7215408086776733","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":"Q2740491$3259B1B1-8520-4A09-87DC-94669D8C1223","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c5c0e74424529b4e7bff1098527ebcd5a0bbd8c8","datavalue":{"value":{"entity-type":"item","numeric-id":3350763,"id":"Q3350763"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f86e43375633eba56e46b840ebc0382e20e7cda5","datavalue":{"value":{"amount":"+0.7127804756164551","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":"Q2740491$899B5E88-F716-48E5-B6D6-F7809ED83448","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1a703ba29129f12b936f639bf3a2bc142676603c","datavalue":{"value":{"entity-type":"item","numeric-id":3972299,"id":"Q3972299"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"15d531c106f9f3818c7826d7e81f71b2b8725cf8","datavalue":{"value":{"amount":"+0.70852130651474","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":"Q2740491$8EBF421A-F87A-428D-9AB3-8721FA8696E3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e29c9d0d5dd063650cf90a057c66abb63bda575a","datavalue":{"value":{"entity-type":"item","numeric-id":3791171,"id":"Q3791171"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2c37c44214f0f757e2a9d537747b28e1c6410306","datavalue":{"value":{"amount":"+0.7084259390830994","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":"Q2740491$E4974654-A018-4277-B7BE-E9DAC5A948DA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On an algorithm of a generalized graph construction for digital device","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_an_algorithm_of_a_generalized_graph_construction_for_digital_device"}}}}}