{"entities":{"Q6828491":{"pageid":15110881,"ns":120,"title":"Item:Q6828491","lastrevid":56009869,"modified":"2026-02-24T13:16:49Z","type":"item","id":"Q6828491","labels":{"en":{"language":"en","value":"Parameterized algorithms for graph partitioning problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6790462"}},"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":"Q6828491$48CEF5DD-7CB6-4BA8-9972-FD58D19DB875","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"802c15ab41ec32ca8334c8333ce69c8587a5e00d","datavalue":{"value":{"text":"Parameterized algorithms for graph partitioning problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6828491$89F63996-C320-48CE-94AD-3B66F3C493B2","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"68abbcb1a764331f4b6a062d3a52db2a73de0543","datavalue":{"value":"1378.68094","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828491$B90A7183-B8EB-4081-9623-4169564914AF","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0c74ccf1f199722d4c4f929c03e2ed035ca30507","datavalue":{"value":"10.1007/S00224-016-9706-0","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828491$F2326A50-C1A2-4303-AF55-72123B1EF460","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b451a2ac0f2c963f77b6135a280741037892792c","datavalue":{"value":{"entity-type":"item","numeric-id":313813,"id":"Q313813"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6828491$CC4B9E14-B7E3-4626-8E3F-487E4654D4E4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7e716ea3f9b35042149c175ca4b857a5eb01a013","datavalue":{"value":{"entity-type":"item","numeric-id":249085,"id":"Q249085"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6828491$1410AD76-A05F-4C29-B996-504BD7028463","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"b559743f011d61696dff04b2ecd3408df2541e49","datavalue":{"value":{"entity-type":"item","numeric-id":169698,"id":"Q169698"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6828491$F7001726-51B1-4809-A80F-8CB67DAFB9C8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9c0381aec861f5a199f46f1776607b0e02f2cdf4","datavalue":{"value":{"time":"+2017-10-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6828491$233603B3-EE2D-4C7F-BE3A-0B1A5977327E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828491$457C5C77-61D2-4F96-A373-730C326B24AC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"625e55f1f2a96178239720bc1bbbe7ad21cf0a75","datavalue":{"value":"05C70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828491$C7BDD173-5006-47BA-ACFB-B1245BC351B3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828491$8723E6DD-D2FC-486D-991A-A1BE91E9281C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"04e71519bbad21253126e8ce25d93d10f656475b","datavalue":{"value":"6790462","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6828491$9929B65E-A0BB-46BF-BFCE-71351D35C903","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"439905524fc0b004f5fd79d6e137ce737123a25d","datavalue":{"value":"parameterized algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6828491$7620EDC4-B7C1-4B7D-B7FA-31CF4F9DD6F8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8e242af08a265f147fecdde71acc893f1df2b816","datavalue":{"value":"graph partitioning","type":"string"},"datatype":"string"},"type":"statement","id":"Q6828491$3884A81D-FB8E-408C-BCFF-78BDEFD56AFD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a36ac926966719d754c8dcca3f885ce15ad6141a","datavalue":{"value":"representative family","type":"string"},"datatype":"string"},"type":"statement","id":"Q6828491$50AEC525-CD5B-4DEA-A458-E30B900DFB37","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cf5b0a50a33186a0167c51b230c3288db5d2eba7","datavalue":{"value":"random separation","type":"string"},"datatype":"string"},"type":"statement","id":"Q6828491$3844AF27-2601-4A89-BA02-CB86260C3F7E","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":"Q6828491$68A794DA-EE40-4321-9C1E-F9D0E4ACDD2A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Parameterized algorithms for graph partitioning problems (scientific article; zbMATH DE number 6790462)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Parameterized_algorithms_for_graph_partitioning_problems_(scientific_article;_zbMATH_DE_number_6790462)"}}}}}