{"entities":{"Q6657029":{"pageid":14268186,"ns":120,"title":"Item:Q6657029","lastrevid":103674446,"modified":"2026-06-06T07:53:13Z","type":"item","id":"Q6657029","labels":{"en":{"language":"en","value":"The unweighted and weighted reverse shortest path problem for disk graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7961912"}},"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":"Q6657029$3FCBBCDE-E332-40ED-A64E-A8ECC7559A13","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"630407efcdc5c8fbc61bc683f2e73b98b6bb73a7","datavalue":{"value":{"text":"The unweighted and weighted reverse shortest path problem for disk graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6657029$7649C744-F949-45F3-98CE-BE1F3EC01A75","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3c7fbfd079fb2a9e74d6da5c3a5f8beebbc136bc","datavalue":{"value":{"entity-type":"item","numeric-id":243604,"id":"Q243604"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6657029$C6B77F14-32D7-47C1-8974-6DF953E676AF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b5de52448e04f050e5b9f069b1a18cc236956934","datavalue":{"value":{"entity-type":"item","numeric-id":364842,"id":"Q364842"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6657029$8E488074-FD80-4E7A-970F-F5F1BC622D5F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"35bc7f911719e7e39a341f40f86cea16ae495e48","datavalue":{"value":{"entity-type":"item","numeric-id":827308,"id":"Q827308"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6657029$462CE7E1-8B31-4C4E-9BDA-1E9F8F6692A3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"05973d4747711a904c4eb354f325fda834906623","datavalue":{"value":{"entity-type":"item","numeric-id":396765,"id":"Q396765"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6657029$B3CEAC88-29C2-4E33-90AF-6DBC51E90F96","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"61d4fcd001548dfc6222d0098d472cd2a6031b71","datavalue":{"value":{"time":"+2025-01-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6657029$6785D98D-8303-4775-BCD7-9FB79931FAD3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6657029$730923C0-9A5B-4771-B35C-D185A84A90AC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e9479d39320635a872d0213eb53d7bd80d885184","datavalue":{"value":"7961912","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6657029$8BEB47CA-7B5C-4435-A9BE-17065F4521F0","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"551d108313cfab3a77b395a647aede7021169ebd","datavalue":{"value":"computational geometry","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657029$10AF4619-9564-4D94-AD55-D93182475EDA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0a2849fed3479edb812a736a871bd6b69ff9f050","datavalue":{"value":"geometric optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657029$08958805-97AB-44FB-916D-02E0DD33657F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"46711ce4680a154430795a0a2d384a793e907377","datavalue":{"value":"disk graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657029$2D6400D5-8CF9-4CE9-A2A4-FF60B4959DB8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"85dcf22f2caea555a5a505dcacfa495672f0b4a2","datavalue":{"value":"BFS","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657029$6065D483-B297-4646-85F6-1F83F6306816","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e3765ba26d918d31a6ae723b9fc1074bd79fd207","datavalue":{"value":"Dijkstra's algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657029$FCB10731-A339-4B64-87E2-0757086AB0F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d574642173f048c30d5c3889c6e62c90dc8b8a3","datavalue":{"value":"reverse shortest path","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657029$B7C64416-A38F-41CF-8139-2E779B82AFA9","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":"Q6657029$1EC69A3E-3E7C-40F1-88B3-224EB8999A5E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"6bdd7c27c1a010e3143669334c57a9df42b7ec71","datavalue":{"value":"10.4230/LIPICS.ESA.2023.67","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6657029$26481C6D-040A-4C23-B967-03A2DCC7BB80","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The unweighted and weighted reverse shortest path problem for disk graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_unweighted_and_weighted_reverse_shortest_path_problem_for_disk_graphs"}}}}}