{"entities":{"Q5901120":{"pageid":8008091,"ns":120,"title":"Item:Q5901120","lastrevid":93390563,"modified":"2026-06-05T04:19:04Z","type":"item","id":"Q5901120","labels":{"en":{"language":"en","value":"A polynomial algorithm to find an independent set of maximum weight in a fork-free graph"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5771586"}},"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":"Q5901120$2186C5ED-AA39-410F-9FE7-4D4CA5D601FF","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b8714024a9ed46ffb483e4736d164b3c8a945f38","datavalue":{"value":{"text":"A polynomial algorithm to find an independent set of maximum weight in a fork-free graph","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5901120$EC4EE844-4E50-4B75-8796-0BF44B712F0F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"00efc5a353e7197608d01d787f263e4ef9ff7c69","datavalue":{"value":"1192.05165","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901120$D7DDD1D9-AFDA-463B-AB2A-FB42EAC2237B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b44b6c5abdc213f757a0ae1ad5864a3503c698f3","datavalue":{"value":"10.1145/1109557.1109561","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901120$2479823C-15F6-4598-BE27-4767D98BF4E0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d9924970a3259a1323042c8227a65163844bb317","datavalue":{"value":{"entity-type":"item","numeric-id":317397,"id":"Q317397"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5901120$A26AEFF8-13E1-4804-B950-8B280A86555B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8d8d3984e24ea7e3319adf181340278eea7058e5","datavalue":{"value":{"entity-type":"item","numeric-id":266922,"id":"Q266922"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5901120$FFC0C753-E31F-4E82-9E19-7359A4DE06F4","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"5689ea3415b577dacf6f3396e99073cb92e17a88","datavalue":{"value":{"entity-type":"item","numeric-id":3581484,"id":"Q3581484"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5901120$0F573179-EA78-47AE-98EB-356426921E10","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4ab1a23b33b6c3db0ddd484ed90ac34e13f69d9a","datavalue":{"value":{"time":"+2010-08-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5901120$5D4FFCD5-762C-4736-99CE-8E3A88EF4E04","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901120$14985F50-1A56-4544-90E9-95DA3D4B309E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"778a85d30f3e92218c1693ecf4105c6ca6949b28","datavalue":{"value":"5771586","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901120$C9E724F5-D0F4-41B5-A692-C95A1293B74C","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":"Q5901120$31737FE4-DE91-4B0A-871F-9477A0389554","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"8322b860d339c2e5338c3b31bf0a52000b006f08","datavalue":{"value":"https://doi.org/10.1145/1109557.1109561","type":"string"},"datatype":"url"},"type":"statement","id":"Q5901120$61A7A493-FEAE-491D-A762-655CD9496710","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a7ae7e6d3eda0c45f48ca4c48f6cfbeb6464cc9b","datavalue":{"value":"W4232451777","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901120$F1993F8C-E42D-49DD-88C9-ED291313DFA6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A polynomial algorithm to find an independent set of maximum weight in a fork-free graph","badges":[]}}}}}