{"entities":{"Q6575219":{"pageid":14186374,"ns":120,"title":"Item:Q6575219","lastrevid":99882434,"modified":"2026-06-05T20:55:21Z","type":"item","id":"Q6575219","labels":{"en":{"language":"en","value":"A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7883719"}},"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":"Q6575219$E0093885-2D3A-4741-8029-CEAE8E96001D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"83ba90f6b2776ed59fb53cbced9fd84dc9ed5db3","datavalue":{"value":{"text":"A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6575219$4A968C15-1769-4649-A21D-E52ACBF7BFCD","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"445e1ebbba5081ccde47508d5bc7f24f40d941e6","datavalue":{"value":"10.1137/1.9781611977073.138","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575219$F27CED33-1551-4773-A026-46B1A410BDC9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"80a18d0bcd1a9f7369088e2d380884690ec35ae5","datavalue":{"value":{"entity-type":"item","numeric-id":3304118,"id":"Q3304118"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575219$BACD10C6-F390-4CE7-99B6-9AE0B64F06DC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ba4bd2d575300d9e6cb1ccf3272dfe1790be5e65","datavalue":{"value":{"entity-type":"item","numeric-id":5020730,"id":"Q5020730"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575219$93DE91F0-FB22-4460-89E9-62044BB8B265","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9139b72f86c11deb670ccdcd723732e8d462951d","datavalue":{"value":{"entity-type":"item","numeric-id":359742,"id":"Q359742"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575219$AAD0C178-45C4-416E-9947-6834F31DB1C5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"20bb98d83d204109387fd4af6383bb63aeda87a0","datavalue":{"value":{"time":"+2024-07-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6575219$E1D08734-BE20-4BAC-8C98-793418397C77","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575219$C6E1D380-EC20-4049-80A5-0AD336683E8A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5fdcc0407fdaaad1b4a87202823eb7d88b13c66e","datavalue":{"value":"7883719","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575219$26063AC3-7A2A-4D70-9238-7F7702C353C3","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":"Q6575219$6488FA36-9951-4340-9671-39BDD3DCB813","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_near-optimal_offline_algorithm_for_dynamic_all-pairs_shortest_paths_in_planar_digraphs"}}}}}