{"entities":{"Q6433639":{"pageid":13566653,"ns":120,"title":"Item:Q6433639","lastrevid":103242545,"modified":"2026-06-06T06:37:04Z","type":"item","id":"Q6433639","labels":{"en":{"language":"en","value":"On the complexity of Dominating Set for graphs with fixed diameter"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7844898"}},"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":"Q6433639$B19361FE-2517-401C-B494-EC8C90AB04F6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"45170dd21fa676e67e724b08d39d43dc9ec45445","datavalue":{"value":{"time":"+2023-04-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":"Q6433639$376A1536-4FB8-4B89-9F86-D6E20C93E45A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c2b1e02a6fcb887056202b8f0fcefd9042723161","datavalue":{"value":{"entity-type":"item","numeric-id":2208333,"id":"Q2208333"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6433639$5FD5D730-2827-4407-8ECA-B5BC0CA2F9DA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9509e521cab85798f9b2b4030f3d9d6300552f2e","datavalue":{"value":{"entity-type":"item","numeric-id":963416,"id":"Q963416"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6433639$36718932-D7F9-4F4B-AC3F-A4C6CBFD922D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8dc252585538d2ef4e07162cef61c79e437a3117","datavalue":{"value":{"entity-type":"item","numeric-id":411243,"id":"Q411243"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6433639$CBE814E9-34EB-46FF-8C1C-E59629D9F7D6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0eb538084cadf4afda91934b9c406f9813fd50f2","datavalue":{"value":{"entity-type":"item","numeric-id":388462,"id":"Q388462"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6433639$EA24BB85-D35B-4EDD-A691-C9A0EDC67CD6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6433639$2EB0A263-2C01-4B7D-BC92-3DD21A2B096D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e1db04ce87e0b46c6365e612060063adfb5dfb21","datavalue":{"value":"7844898","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6433639$8F97ECE6-3961-44D3-99BA-68B7B16F625C","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":"Q6433639$CEEDB1A7-DF21-4891-BE97-8706D4F2A0FE","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"8781d855baec63d08bda6594e4380e43bd4448b9","datavalue":{"value":"https://doi.org/10.1016/j.tcs.2024.114561","type":"string"},"datatype":"url"},"type":"statement","id":"Q6433639$FDCB576B-C8FA-437F-8FC7-8974B2A2EAB6","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"b577f4f0103c5446de2294334ca1e99fc7cf55be","datavalue":{"value":"W4394849826","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6433639$5C8CD026-1FDD-4D02-A17A-E0848C46F168","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"278a399337729741124bb4e2814b3460c1e8331a","datavalue":{"value":{"text":"On the complexity of Dominating Set for graphs with fixed diameter","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6433639$B017ECBC-A220-4A0A-9998-522DF455E877","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0f7d596509efb67dc6089cf8cd54321741a5de16","datavalue":{"value":"10.1016/J.TCS.2024.114561","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6433639$A5518059-0140-44BA-A075-C30185662D50","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the complexity of Dominating Set for graphs with fixed diameter","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_complexity_of_Dominating_Set_for_graphs_with_fixed_diameter"}}}}}