{"entities":{"Q6602460":{"pageid":14213617,"ns":120,"title":"Item:Q6602460","lastrevid":95609105,"modified":"2026-06-05T09:24:02Z","type":"item","id":"Q6602460","labels":{"en":{"language":"en","value":"On graphs coverable by \\(k\\) shortest paths"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7911106"}},"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":"Q6602460$AC2AA34C-DDEB-4237-AF15-3B2E0FE9F440","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ace41ed88a07396f3170a9fd6cd4e2bc7419cb9a","datavalue":{"value":{"text":"On graphs coverable by \\(k\\) shortest paths","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6602460$5A147D49-5880-4128-90F3-6B3FD95719BC","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9385f6ae671289fd8232b976201c8a4ff9198005","datavalue":{"value":{"entity-type":"item","numeric-id":2696281,"id":"Q2696281"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6602460$760EDFA5-95F8-40B0-B230-24B4DE88340D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fd05427d88d209847bdc3a19cd96b123f896a935","datavalue":{"value":{"entity-type":"item","numeric-id":311494,"id":"Q311494"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6602460$6166FD9A-DA6D-46C3-B1CD-7F07C34DF4BF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e5d780a1d33433bb4a7fddd5eb1395474ef6755e","datavalue":{"value":{"entity-type":"item","numeric-id":393082,"id":"Q393082"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6602460$EB9DAE81-E2A5-4288-BDE7-D7C3E7B92D31","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"af419286ecf991e9ca3655f7917745d7c4306b08","datavalue":{"value":{"entity-type":"item","numeric-id":344838,"id":"Q344838"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6602460$545A0EFD-4C19-4844-B3A3-C7D58C5BC5B0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"984357184e36bd48b60e905848ca8fb15ede5c75","datavalue":{"value":{"time":"+2024-09-11T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6602460$BEC6E1C4-9550-46F4-BBA7-45B48A65BE5A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6602460$49018D47-BBC1-4A78-A8A5-E6829B5A89D2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2d9f451287bf2f7d452abefa3abaf957ca70baaa","datavalue":{"value":"7911106","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6602460$9275720A-A7E1-432E-9B43-AA6E6C9A6543","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"69d0c99f1e5283b31715a9c7d799852fe62c506e","datavalue":{"value":"shortest paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q6602460$7FEA786C-6E1F-47FF-A8F6-F6517277AA14","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a2f353d971b9a6ac8281ee3195f9d04778503565","datavalue":{"value":"covering problems","type":"string"},"datatype":"string"},"type":"statement","id":"Q6602460$4603C406-971F-4885-934C-F0C216024A51","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2a6ff5360c992006d80bd7cc4152529a3c899d52","datavalue":{"value":"Parameterized complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6602460$A051DDCF-5E63-4343-967D-85F34EBDD846","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":"Q6602460$8795A4E5-C70C-4FBF-A77E-367A58FB9F1E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4a71d52c1cbe06be8d7be8e1b763e70f0c1b8cd7","datavalue":{"value":"10.4230/LIPICS.ISAAC.2022.40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6602460$F5335214-7500-4167-A87D-4DB4320586EC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On graphs coverable by \\(k\\) shortest paths","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_graphs_coverable_by_%5C(k%5C)_shortest_paths"}}}}}