{"entities":{"Q2767414":{"pageid":2778153,"ns":120,"title":"Item:Q2767414","lastrevid":79383380,"modified":"2026-05-06T13:46:52Z","type":"item","id":"Q2767414","labels":{"en":{"language":"en","value":"Graph extensions and some optimization problems in sparse matrix computations"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1697424"}},"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":"Q2767414$55AC7D23-8781-4A72-BD84-4A10356A319A","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"542abcbb0bed6253e240f0f4d514119b5e510a71","datavalue":{"value":"0997.65076","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2767414$7826C4B0-4CE6-4950-8EAD-CC1B426EAEF1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"09a2785f3a7fb107a15da6cdfc4554da314b6c03","datavalue":{"value":{"time":"+2002-01-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2767414$1780A9CB-3603-4611-AF3A-1E3FE7319872","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"bb68a4ead97a966e0738a004317f6777af7ecfa4","datavalue":{"value":"65F50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2767414$2A3FB0C6-648C-4CE3-92E8-EBFA1CF7C5E7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5333d0205ccf54f8482367bfadbaa8f4afc5f8fb","datavalue":{"value":"05C78","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2767414$EA118ACD-1BF1-4966-A5D6-774E620E0EFE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2767414$405887FF-BDD1-4162-A69F-C7BC3A969609","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"898109ac7e401de8fce76101fe27418b7afd5158","datavalue":{"value":"05C50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2767414$DA95FB2A-344E-4B17-8053-D8B9CEAEDBD5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6a2ce7a52063415d4474b9ada56ed2b4419a9ba4","datavalue":{"value":"1697424","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2767414$E3598C42-EDFC-47BC-B075-22E04C5580FB","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8f605a25cd50bb47d7e4b97e75bf0ddc5fe68398","datavalue":{"value":"sparse matrix storage","type":"string"},"datatype":"string"},"type":"statement","id":"Q2767414$F9F6936B-0A1A-41B7-A0F6-A3143982C674","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"42f5d962eb976ccd6fb346e84f511c23dba1ad5f","datavalue":{"value":"elimination, graph labeling","type":"string"},"datatype":"string"},"type":"statement","id":"Q2767414$A0B0F6A4-2DDA-4B46-9258-C2D8C0D219EB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"72eeea5aae3e2bcbf7776e0eadab9addf595861e","datavalue":{"value":"graph extension","type":"string"},"datatype":"string"},"type":"statement","id":"Q2767414$7048AE48-59EE-4B1D-B369-3D2F6112C4C7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c27024bc3112e6fbf1cca0a9a4aacb8e7e4a77e0","datavalue":{"value":"optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q2767414$F9EF68E0-D9CA-442F-9153-4CE01D9A1CF2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"316dffa0af35a3b1ef4a7629f12bf0dc94425b5d","datavalue":{"value":"sparse matrix computations","type":"string"},"datatype":"string"},"type":"statement","id":"Q2767414$4B77A9D9-5456-4283-8046-65B8CDCA8245","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2ba0cc3f7aaac8445724ef309c9eecb57f5a563d","datavalue":{"value":"computational complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q2767414$A83FA054-2047-4161-80BE-38F61C2D4C5E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ed46a2bafd0d091c110d03b1451660835d0b215e","datavalue":{"value":"polynom-time algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q2767414$DA85EFB0-E391-491C-806D-4C5C33FF84B8","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":"Q2767414$02843E85-5DB5-4642-8AF4-07304B2749CF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c0174b0f8b896ae270199ec6d16963d96bdb1d87","datavalue":{"value":{"entity-type":"item","numeric-id":6132387,"id":"Q6132387"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2767414$263DEF70-87D7-4B93-9EAB-E59EE1C91CC2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"73b68cfe3160368a41b8ae13ff319845659f1aeb","datavalue":{"value":{"text":"Graph extensions and some optimization problems in sparse matrix computations","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2767414$D2D86E5F-BAB6-4794-99F9-8A4DF109FAA6","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"53daa90fc77a570319c637034be5955a1e734d5f","datavalue":{"value":{"entity-type":"item","numeric-id":6579860,"id":"Q6579860"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2767414$9C077519-8CDF-4DE7-B23E-B15BF5B451FC","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"80f3c8461c879fea2fa4e2e9dd091bfb7717fcf3","datavalue":{"value":"The author presents theoretic approaches for a class of optimization problems from sparse matrix computations. These approaches facilitate the study in several aspects, as follows. The first aspect is the computational complexity. Some results are obtained on the complexity by using the relations between problems in different areas. By using the neighbourhood representations efficient heuristic algorithms are designed. Further special cases are studied for which there exist polynom-time algorithms. Finally, relations between different graph-theoretic parameters are given.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2767414$2048713D-B137-43F2-AC55-B904B8C9BC6E","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"b66b8f73daeece0054a41db06e7bb7519b2fb73c","datavalue":{"value":{"entity-type":"item","numeric-id":587825,"id":"Q587825"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2767414$D1401E28-03A3-46F3-9E36-375D71DD26EB","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4e7f39d242d662cc19cedfecace85ee0723a4077","datavalue":{"value":{"entity-type":"item","numeric-id":3690096,"id":"Q3690096"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"46e8cab7e00ab0ef704cc88357bcd57db5486c2f","datavalue":{"value":{"amount":"+0.7421571016311646","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2767414$1E0C3678-5A02-422F-A803-59307DABA7F9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"621000846ed66f210794814455de5f3c6aecde93","datavalue":{"value":{"entity-type":"item","numeric-id":1647455,"id":"Q1647455"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4bc498f5dff34faa46a3b9e6783f15bc4ec45af7","datavalue":{"value":{"amount":"+0.726313054561615","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2767414$81C07679-AF30-4F0F-88BF-27E2C8CC1454","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"76f9356c54f2051ac048492988ec84a993aae4d2","datavalue":{"value":{"entity-type":"item","numeric-id":751503,"id":"Q751503"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"580c121b6b0760b8f12c77118de75b7d95435cc3","datavalue":{"value":{"amount":"+0.725395143032074","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2767414$7B75485E-3FB8-4A9B-949B-0CCEA80E2717","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ba9eeab51a0c847b238ade0a1e3f1af33aed6a2f","datavalue":{"value":{"entity-type":"item","numeric-id":3683420,"id":"Q3683420"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ab8d0024976b6a2fa1c3ef53452c073bb7b20354","datavalue":{"value":{"amount":"+0.7221840023994446","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2767414$E75BE3B0-3C17-45C0-885A-A7822A4A673D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e28f658b46bcf4588505b2face0eea80525f9540","datavalue":{"value":{"entity-type":"item","numeric-id":4809867,"id":"Q4809867"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"7687a8adb28faff4aad44ba6539730fa5adbf3ab","datavalue":{"value":{"amount":"+0.721664547920227","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2767414$3C2C9BEF-8473-49B8-96EA-A5ABF4B576FF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Graph extensions and some optimization problems in sparse matrix computations","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Graph_extensions_and_some_optimization_problems_in_sparse_matrix_computations"}}}}}