{"entities":{"Q3945594":{"pageid":5975499,"ns":120,"title":"Item:Q3945594","lastrevid":81285752,"modified":"2026-05-06T18:10:18Z","type":"item","id":"Q3945594","labels":{"en":{"language":"en","value":"Efficient parallel algorithms for some graph problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3763307"}},"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":"Q3945594$77D100B2-C1F4-402F-92CA-9108F8CFD450","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"96d7806e3e8e1e25bb3edd9dbaaa7012b72f4af7","datavalue":{"value":{"text":"Efficient parallel algorithms for some graph problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3945594$D137548D-4C46-494C-9E66-9CA20F415B76","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8903074eb7990d419d427cdf7ab40f52c755220d","datavalue":{"value":"0485.68056","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3945594$7D9D24AF-50A5-4B06-B771-49F61ACF202A","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7f60f1eecdcad153abb6dc86f1ad9086e2954a6b","datavalue":{"value":"10.1145/358628.358650","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3945594$A3F46E1D-C5E7-4B71-A7E2-FD6CA7DD3919","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8a557ae6c00e56ca6798de2f52d91bedefaf4408","datavalue":{"value":{"entity-type":"item","numeric-id":3945593,"id":"Q3945593"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3945594$B873BDB2-6133-4318-B35F-5E2D957EEEA4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6832677c76eccefedca84960aaa8de84abf41339","datavalue":{"value":{"entity-type":"item","numeric-id":3856657,"id":"Q3856657"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3945594$2D7A33C5-8378-400E-B3B6-386EBA282A4F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ca27f7bdaa490e761f9f7c24443656b33b69930e","datavalue":{"value":{"entity-type":"item","numeric-id":328688,"id":"Q328688"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3945594$FF0A5242-05D1-4A66-9CF0-139C85641578","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"47f57cd36df9e30d446df3867dc3917e4ea74654","datavalue":{"value":{"time":"+1982-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":"Q3945594$50DB232E-A52E-4591-867F-AC9BCD2FA9DB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3945594$6566F1B9-37FF-419D-A842-5F986067EA72","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3945594$F903A6ED-589E-4669-85B3-98AC2CAB35BF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ec3769495799f08479987ac368adf64f125a2b66","datavalue":{"value":"68N25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3945594$BDBE7E8B-0D08-4A74-9B57-637D3B54D010","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"39c08e5f00a31b6ff473b0b444a55537d3b3472b","datavalue":{"value":"3763307","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3945594$C12524C9-0BAC-4A62-8E4E-BEE80B61A533","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5698b77af48c1001f35b8ec3abfe3559bb265d15","datavalue":{"value":"single instruction stream-multiple data stream model","type":"string"},"datatype":"string"},"type":"statement","id":"Q3945594$F302A68E-E269-4A4D-940E-5C6CDBDFD09E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7e93d956f5bd7390ccf021770121bac9ab69e234","datavalue":{"value":"multiprocessors","type":"string"},"datatype":"string"},"type":"statement","id":"Q3945594$C7DCAC72-B66B-403A-A6AD-BA522D220002","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"90bc349d6d55eb8026148892e900ce256ffdd986","datavalue":{"value":"analysis of algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q3945594$F7E79C65-D3B5-402A-90C0-969A38973A39","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"10a04894b3d4c74455e3670a94f71160640a46c5","datavalue":{"value":"tradeoffs among complexity measures","type":"string"},"datatype":"string"},"type":"statement","id":"Q3945594$AF32F296-B66E-45B8-A83A-4075AABF5ECA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c691652e78f194f9b451770fc9c15406bebf29a7","datavalue":{"value":"optimal algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q3945594$C895B34B-9896-40CD-9DA2-EF48E6AC56F6","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":"Q3945594$6677797A-C9B7-43D1-BC87-888EE95810CC","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"333a9e10c74e91dbfba5eb938fbfa99860e66731","datavalue":{"value":"https://doi.org/10.1145/358628.358650","type":"string"},"datatype":"url"},"type":"statement","id":"Q3945594$097C5F9C-3333-46B5-902C-268E835F1BC9","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"5baccae8d39a1033d314a64c0571fbb7c05ea30c","datavalue":{"value":"W2069446854","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3945594$A7BF9060-74E6-46FE-8863-4FD08ACEB76A","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087426e75e65ba42be09a15851f31de13b7aa5f3","datavalue":{"value":{"entity-type":"item","numeric-id":56730,"id":"Q56730"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3945594$1A9F37E6-492A-458C-A3F1-55F6004DA994","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient parallel algorithms for some graph problems","badges":[]}}}}}