{"entities":{"Q2741473":{"pageid":2752212,"ns":120,"title":"Item:Q2741473","lastrevid":41956757,"modified":"2025-05-19T14:59:12Z","type":"item","id":"Q2741473","labels":{"en":{"language":"en","value":"An \\(O(n^2)\\) algorithm for the characteristic polynomial of a tree"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1642879"}},"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":"Q2741473$5486EF83-66FC-4697-A75D-A76FD72CD564","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"6f507cb923f1fa073172755cb65408a8f46eb1df","datavalue":{"value":"0982.68099","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2741473$234B12F7-1F15-4DEB-943E-2AAFE7F8A678","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6aa0ac1e3ab48f07fc6f0e61d17431d223063f44","datavalue":{"value":{"entity-type":"item","numeric-id":221640,"id":"Q221640"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2741473$3610AE50-049B-49FF-9AB1-C6189AC38FB8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5719904a1a2587f5e67eb9a0f490ffe3cdcfbbf9","datavalue":{"value":{"entity-type":"item","numeric-id":2654398,"id":"Q2654398"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2741473$038F636D-F3FC-4B97-9688-DCBCC21D72EC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2fc6903e4063ffc4464801f44d4590f4b4833ffa","datavalue":{"value":{"entity-type":"item","numeric-id":307804,"id":"Q307804"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2741473$172CCB80-F9C8-4492-8372-8DF3F30C9399","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"db3817d161b0670e4149da15035f59b540781716","datavalue":{"value":{"time":"+2001-10-24T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2741473$20DCAAE7-F4CF-4887-A267-B8E797CADE34","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2741473$EB7C266D-67F4-414F-998B-DF76AC0B8D89","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d9083c6cbebea250fd574c3c251bd7142115e319","datavalue":{"value":"1642879","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2741473$BF75217C-3B0E-49AA-AF7A-F83DDB0CABC0","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cc95e5f05c3d9f83a111dedb75f49c2d26fec40f","datavalue":{"value":"adjacency matrix","type":"string"},"datatype":"string"},"type":"statement","id":"Q2741473$F1A95DEA-EFEC-4A39-82C8-C13DC39A87A3","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":"Q2741473$E266CA0A-CBCC-4C3F-A106-BB349CB2F58B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0c7c4def9e4bf3fc9890d20dd4a5425b22d55ae1","datavalue":{"value":{"text":"An \\(O(n^2)\\) algorithm for the characteristic polynomial of a tree","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2741473$5819E4BF-2180-4F46-913B-83F31CF240FD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2741473","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2741473"}}}}}