{"entities":{"Q1058301":{"pageid":1060149,"ns":120,"title":"Item:Q1058301","lastrevid":67016511,"modified":"2026-04-12T14:21:21Z","type":"item","id":"Q1058301","labels":{"en":{"language":"en","value":"A parallel algorithm for the enumeration of the spanning trees of a graph"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3900174"}},"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":"Q1058301$4445EBAF-E93E-453E-A3BB-2706A237775F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a568a4ba46dd8a83a501031d0e6862a7354184db","datavalue":{"value":{"text":"A parallel algorithm for the enumeration of the spanning trees of a graph","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1058301$2E9C4EDC-FA2A-44DD-AA42-12B58A4E8D4B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c8864a66289cd2fa8ab5dc910b94ddd2f8bde6eb","datavalue":{"value":"0564.68051","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1058301$A6FC4B8F-01B0-4A79-BDE4-B2D696443266","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"97bab403365f8c83c4f50b3801637680e78d7730","datavalue":{"value":"10.1016/S0167-8191(84)90197-2","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1058301$761F30D2-9E19-4B6D-9CD6-94E308DD1A68","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"97be96c30bdc1114bbf6eb5b42322ad4fa253aa1","datavalue":{"value":{"entity-type":"item","numeric-id":1058300,"id":"Q1058300"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1058301$E6000CFC-7F76-4EA5-BA45-9EB5C9C2A05E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"29b05d6219fc013336227ff4d652f78f05b0ac25","datavalue":{"value":{"entity-type":"item","numeric-id":579832,"id":"Q579832"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1058301$05632333-0F48-45A8-9DA9-C2528C3AC0AA","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"eeac13f60c55bdb04ecb49274cc7b24a1688345d","datavalue":{"value":{"entity-type":"item","numeric-id":71527,"id":"Q71527"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1058301$45AAB094-74FC-4515-88D6-124D7F44C63A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3c94df5c9af0ede578c52141befd29044de13172","datavalue":{"value":{"time":"+1985-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1058301$791C0852-7959-4E1D-AB1D-8423D3905D58","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"323e00c611d2d540d375f8e120b8eeb20154911c","datavalue":{"value":"The problem of enumerating the spanning trees of a graph arises in several contexts such as computer-aided design and computer networks. A parallel algorithm for solving the problem is presented in this paper. It is based on the principle of the inclusion and exclusion of sets, and not directly based on the partitioning of the graph itself. The results of the preliminary experiments on a MIMD system appear promising.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1058301$4381796E-7C70-427B-8858-5208018F2622","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1058301$64C7D253-E9D2-428C-A7FE-23097EA18E7D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"71ba23fd74e72c48216e09aac5ce7dbe28a841a4","datavalue":{"value":"3900174","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1058301$8DA301E1-2438-4442-8C45-F5342BD4FCED","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"135b29ce08dc059e2ef7acdfa2b40ae291019433","datavalue":{"value":"MIMD computer","type":"string"},"datatype":"string"},"type":"statement","id":"Q1058301$0A684525-A850-4D8D-9169-949A11401446","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"79fea923fe257428a15567ac9a4393a98e6d9e26","datavalue":{"value":"spanning trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q1058301$59CCF205-EFF2-44F7-A018-CDA91A5D574B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0967c5f93d36d6aa18ee008d77ee288965d952b9","datavalue":{"value":"parallel algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1058301$562FCA2C-A2F2-4589-9242-86DF52C3C1DB","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":"Q1058301$8D946A31-39B7-474F-A3A7-F17B7454406C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"8561ff1769d673cc7d13de1e1e2cc80ed059359c","datavalue":{"value":"https://doi.org/10.1016/s0167-8191(84)90197-2","type":"string"},"datatype":"url"},"type":"statement","id":"Q1058301$B1E30530-2492-464B-9CD6-706F0ECE7701","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"dd6615264a1c2e6d3bf95e4c879df045456b5f0a","datavalue":{"value":"W2051184192","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1058301$71D975BE-4382-4CBC-A135-6BC024FEBE23","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d79b99f6b2f66b94db725a54f31ec5f628a8b909","datavalue":{"value":{"entity-type":"item","numeric-id":2062131,"id":"Q2062131"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"510b72c0d61554688e35cd0b41245d5da31e6ba0","datavalue":{"value":{"amount":"+0.7523002028465271","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":"Q1058301$70CA515A-6EE9-494F-9C93-763740DD8299","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ffa274aae3f641da0b545a06dcbc1ee88c843b0d","datavalue":{"value":{"entity-type":"item","numeric-id":3341895,"id":"Q3341895"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0e5a0e1d3dca9b3c2f2ff13591104bdfed2b9a1d","datavalue":{"value":{"amount":"+0.7349572777748108","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":"Q1058301$BD14F582-BFE5-42C8-BAC6-29852F3B312E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8885f4c1e0410743b275059ac503edab03af8158","datavalue":{"value":{"entity-type":"item","numeric-id":4213879,"id":"Q4213879"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b8485dcd2565eae146b5d20e523b655419b74de1","datavalue":{"value":{"amount":"+0.7038707733154297","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":"Q1058301$BEDB1561-F636-47E9-9E70-DB2CBA49F676","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ebe83b879a62e2de2ec19ec90ae6b5e50c345d39","datavalue":{"value":{"entity-type":"item","numeric-id":4361564,"id":"Q4361564"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"11d680a6dd908a2f52d2929b3a5e1fcc14bc8723","datavalue":{"value":{"amount":"+0.7030141353607178","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":"Q1058301$3687768D-6A70-4A8E-9385-7E668D381F0D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"437e32e4ceb5f010545181e0992d5f4dbd9d6645","datavalue":{"value":{"entity-type":"item","numeric-id":3033347,"id":"Q3033347"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5b3805a538daca0a9195e50c4946dcc5b5b3acc0","datavalue":{"value":{"amount":"+0.7029517889022827","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":"Q1058301$2FEDEB37-40BA-486F-A023-CC576F9AF15A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A parallel algorithm for the enumeration of the spanning trees of a graph","badges":[]}}}}}