{"entities":{"Q1160148":{"pageid":1170897,"ns":120,"title":"Item:Q1160148","lastrevid":67005189,"modified":"2026-04-12T14:16:45Z","type":"item","id":"Q1160148","labels":{"en":{"language":"en","value":"Space efficient algorithms for some graph theoretical problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3749061"}},"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":"Q1160148$F9FE74C5-D44E-4D05-8460-3EE362843D40","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e454dbc5eae02fc1d42340dc81fb3d833c1b4aee","datavalue":{"value":{"text":"Space efficient algorithms for some graph theoretical problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1160148$15B85447-824E-49FD-872A-C00A7FF901A3","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"85b6b69fcbf5127a89efe366a34371ff118b96e5","datavalue":{"value":"0477.05060","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1160148$5F734712-69B4-4DC8-9F39-4923C16BCF25","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"92233b16fca588b20458d96fbd4f8570d6b2ce27","datavalue":{"value":"10.1007/BF00264160","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1160148$1EA64025-7B6B-45DA-A6AD-351B17A86740","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0f473994f7e281bbb2dcc83030561a1e638216d1","datavalue":{"value":{"entity-type":"item","numeric-id":579926,"id":"Q579926"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1160148$F6822BC6-E2BA-46E8-BC4A-A1CAABC453C5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bd51aec820ad81546fe69975eab1ae2dbb826f71","datavalue":{"value":{"entity-type":"item","numeric-id":1365678,"id":"Q1365678"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1160148$ABFF6216-2DF8-486F-8800-C8A690C38355","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"7d0f02e85530cd06ceb2c58a40dc9c2e0258e194","datavalue":{"value":{"entity-type":"item","numeric-id":161641,"id":"Q161641"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1160148$AA822513-9A9B-4F48-89B6-25CD2C7557C7","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":"Q1160148$A9217256-8B64-46BA-8C16-A49FE1F096B9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e35cfda1c439de499de525a8a9009114d934bb37","datavalue":{"value":"05C99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1160148$F50A4A9D-C1EE-456C-A71D-DFDCE5E53D4C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"357c7c34a1a90d83243f17011b7aa90788d1792d","datavalue":{"value":"05C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1160148$A80921BD-4F61-41D8-ACC1-36DDA9F88F1C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9ed1e3c6cced595a05b8ae19055521b22405b78a","datavalue":{"value":"68W99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1160148$1EF43F1F-3EDE-4C82-987E-D7107DB20FDD","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ce49e3bca6af6dffefcaedee638defc668086880","datavalue":{"value":"3749061","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1160148$8F73C709-A91B-4961-9CDA-39187D602CC9","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2bf0882370430827bf0ad95308baea9eb0d81fc7","datavalue":{"value":"deterministic algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1160148$4608137C-0F01-4887-B9E9-CFBFE04E7887","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e3744d15beadc0dbcb2f518132d24966a53bb56b","datavalue":{"value":"planarity testing","type":"string"},"datatype":"string"},"type":"statement","id":"Q1160148$5D32EA2B-7D57-4481-9880-EA68ECDFEE0D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3c3fddcf64828be26e41dd433c25c5a84db01419","datavalue":{"value":"producing a plane embedding","type":"string"},"datatype":"string"},"type":"statement","id":"Q1160148$80FDC62A-834A-4578-AB5C-EC98D354F96D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"664375d7c0243dcc287e5489e058e4ddf905c2fb","datavalue":{"value":"minimum cost spanning trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q1160148$BA212456-B05B-409E-8978-0077F7512EFA","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":"Q1160148$69B94092-354C-408D-BAFB-505F8780D44E","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"a435e2fa113175da20b4cfbfba57bf0706f8ab6f","datavalue":{"value":"https://doi.org/10.1007/bf00264160","type":"string"},"datatype":"url"},"type":"statement","id":"Q1160148$56785043-B26D-41E2-8626-E8D811FBB89D","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"92424770ced4bf82f432f52b8ca86cd10c819cdc","datavalue":{"value":"W2077095124","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1160148$50016086-4F7D-4A9D-9D94-6844378180F8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Space efficient algorithms for some graph theoretical problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Space_efficient_algorithms_for_some_graph_theoretical_problems"}}}}}