{"entities":{"Q6052038":{"pageid":13186194,"ns":120,"title":"Item:Q6052038","lastrevid":39669523,"modified":"2024-12-30T16:58:24Z","type":"item","id":"Q6052038","labels":{"en":{"language":"en","value":"A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7740859"}},"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":"Q6052038$69106D2B-506A-4AC7-AE42-DD98BD7E1666","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4332e44e1f5d082761136509e8a252458d8053a8","datavalue":{"value":{"entity-type":"item","numeric-id":5146759,"id":"Q5146759"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6052038$35931A09-8506-4A4B-95D4-DF795BFD3D0B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a696ac940d028b864dab1bfd979b9c0923bca974","datavalue":{"value":{"entity-type":"item","numeric-id":251302,"id":"Q251302"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6052038$E462EF7C-BE9C-4255-8B07-058760DB6DA6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6540147dd2ce3bd9b08bf74a14b0ebf353350e4f","datavalue":{"value":{"time":"+2023-09-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6052038$00BC68B6-E69E-4028-BFF0-8EFAD2D8F0E2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6052038$C558303F-670D-46F1-B8CF-21BCF51BF2AB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a96018aaea7b5fb9c89dc5adf97432da6838809f","datavalue":{"value":"7740859","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6052038$B18F4792-B35C-4148-B1CA-20DD098552E5","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ed3b495ba8c3c3bf5babb1d3213a6c0bf58078e5","datavalue":{"value":"graph algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6052038$37AC6D33-1DF0-481A-8DA6-50DF9C444A46","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"169302d6c61f8540e0eebfe4d6fc6684d1877299","datavalue":{"value":"approximate all pairs of shortest paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q6052038$6978E00E-6B1B-4608-8F32-853BC2000275","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ab0f102f99a61be25b5b8cb5f7adf0b97b4216f8","datavalue":{"value":"distance oracles","type":"string"},"datatype":"string"},"type":"statement","id":"Q6052038$2ED7FB47-1D3D-42B7-99C6-134EF3FC942B","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":"Q6052038$1D6C919B-438C-4F0B-8683-6730C63FEA09","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"5ef28c6178c439dd60fb9dac9798250ff74a2d14","datavalue":{"value":"https://doi.org/10.4230/LIPIcs.ESA.2021.4","type":"string"},"datatype":"url"},"type":"statement","id":"Q6052038$061BBD65-B316-4092-A3E7-FF0C2765B363","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"319aa51c873a57caa44f8d6a2301152e8e621cee","datavalue":{"value":"W3196638783","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6052038$9D03AA5F-D1CB-4A14-9C49-37C0C90F6ECA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"66bcb5bb30c52e0870187d3d1fb9b0e41de9a5f2","datavalue":{"value":{"text":"A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6052038$78537628-7F75-4352-B9EA-89EAB26EDF12","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d0598764455ac7c8c1de3ce9c4339b3c40a73f0b","datavalue":{"value":"10.4230/LIPICS.ESA.2021.4","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6052038$B536E508-3E63-4714-97ED-6C32BB1B3A5C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:6052038","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:6052038"}}}}}