{"entities":{"Q3954831":{"pageid":5984736,"ns":120,"title":"Item:Q3954831","lastrevid":88102673,"modified":"2026-06-04T13:38:50Z","type":"item","id":"Q3954831","labels":{"en":{"language":"en","value":"An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3774898"}},"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":"Q3954831$63FDFFA1-13A0-4A8C-A6CE-D9D4B1F83FD2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"9f3524bc5d7e44e537ca68742dd5dc0d59b1e0dd","datavalue":{"value":{"text":"An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3954831$6B6883D2-3D3E-4BA0-A5F4-00C11DD792E8","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"79e4f1db8397eec8da5d9b1d03a531ef7cc64016","datavalue":{"value":"0492.68051","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3954831$A4880802-AE25-4B86-A85C-93B2FF8F0A9E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"36c2a3b77dd9516204a2a085bf3186c934250890","datavalue":{"value":"10.1137/0211055","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3954831$DAF5430B-DB0D-4B22-B8E3-218902CEE6A3","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9ee68de2af4277a285837f24c0d6ec9f5b26f572","datavalue":{"value":{"entity-type":"item","numeric-id":205117,"id":"Q205117"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3954831$84CD2514-FB04-4393-AAC4-CB27801B2965","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6d6129f2694707a8dc943ba2b6db8331eade716e","datavalue":{"value":{"entity-type":"item","numeric-id":788488,"id":"Q788488"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3954831$0E21426E-0970-4087-A8EF-D9F74595B754","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"da93d7c45d552338138e673e141df03679ac5cb5","datavalue":{"value":{"entity-type":"item","numeric-id":226821,"id":"Q226821"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3954831$2DA4D0CC-1B2A-4764-8B83-3CAE97E297B3","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"c2a1c45d0f0997786c62faf9f7fcd603424632e8","datavalue":{"value":{"entity-type":"item","numeric-id":84798,"id":"Q84798"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3954831$DA4D18FC-EA56-4212-B20A-C6F02D3E2554","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"47f57cd36df9e30d446df3867dc3917e4ea74654","datavalue":{"value":{"time":"+1982-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":"Q3954831$7C71846A-A3E7-4AF0-8A45-6D540C904F88","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3954831$0F8115C5-7E0F-46CE-A1A7-3A87571EF9F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3954831$90229B99-6379-45A7-B396-782F5EE7C8ED","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ad5a10b10b73262ed4a50378c56c284c380f73f8","datavalue":{"value":"3774898","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3954831$3F597D25-9009-4ABB-84D3-ED0EA5FBC0E2","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"215ec7c18938e6baa56db8b86557bde4f5b7e244","datavalue":{"value":"bounded worst case ratio","type":"string"},"datatype":"string"},"type":"statement","id":"Q3954831$E3D216A5-C3A9-405A-8349-19328DE50AD9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4346bd7cfa5a9bbf731ad419a908e87711e384b3","datavalue":{"value":"time-complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q3954831$CFD7246B-A465-4900-87F2-474F1E8E858B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d23702d55e64fcf67026607c0f92621a5ac2163b","datavalue":{"value":"vertex-identification","type":"string"},"datatype":"string"},"type":"statement","id":"Q3954831$C11E49D8-0DB5-4DC3-A2FF-84AD216873A9","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":"Q3954831$582BCFC5-3467-4080-8C57-142BCAFBA48A","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"6e92a9bcd481d460355b79b2dd89489eb4bf95e5","datavalue":{"value":"https://doi.org/10.1137/0211055","type":"string"},"datatype":"url"},"type":"statement","id":"Q3954831$34B2AAFB-FF4A-4EBB-9BB6-A43DBDE62627","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"195b1fe8400384b1b4e578471ed316a859571cc4","datavalue":{"value":"W2042977557","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3954831$CFC953F9-0127-4484-9753-92E8F2FF29AD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_Approximation_Algorithm_for_the_Maximum_Independent_Set_Problem_on_Planar_Graphs"}}}}}