{"entities":{"Q7129138":{"pageid":22002159,"ns":120,"title":"Item:Q7129138","lastrevid":106927937,"modified":"2026-10-23T09:11:20Z","type":"item","id":"Q7129138","labels":{"en":{"language":"en","value":"$w$-Dominating Set Problem on Graphs of Bounded Treewidth"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q7129138$5856DF7D-B133-4341-B68B-BDC9D024118E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f4b9274d72c656443835c8d32cf208daa1d298dc","datavalue":{"value":{"time":"+2021-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7129138$74AC3B23-8A4F-4D9F-9F6C-4B565DFB7F9C","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"068471bcb36ee835581e30b73e110b35b0c321f8","datavalue":{"value":"2101.02867","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7129138$06CF9328-3914-4F3A-8B8B-E51C86D1599D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"219e3305a84c34e44f97e9a2497d79086eaad2a3","datavalue":{"value":{"entity-type":"item","numeric-id":6538310,"id":"Q6538310"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7129138$C4F5BD85-7937-454B-802B-B0E2B5ACF58A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9fd14e45d53468c8010c651737c73736a189c385","datavalue":{"value":{"entity-type":"item","numeric-id":221708,"id":"Q221708"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7129138$37827C26-B669-4D85-80F0-CD9E12381485","rank":"normal"}],"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":"Q7129138$265C94C9-C183-4E50-BD76-B0D25930948D","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":"Q7129138$FDAA71EF-A991-42AE-9530-A619DCCF1FC2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"$w$-Dominating Set Problem on Graphs of Bounded Treewidth (scientific article from arXiv)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/$w$-Dominating_Set_Problem_on_Graphs_of_Bounded_Treewidth_(scientific_article_from_arXiv)"}}}}}