{"entities":{"Q7021069":{"pageid":21629322,"ns":120,"title":"Item:Q7021069","lastrevid":76704171,"modified":"2026-04-24T20:14:06Z","type":"item","id":"Q7021069","labels":{"en":{"language":"en","value":"Approximating spanning tree congestion on graphs with polylog degree"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7990676"}},"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":"Q7021069$DC95D405-521A-4434-B527-B9F1CCF824CC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"074245a77dc952c4ef5887e6c8bde38a1e8a81b2","datavalue":{"value":{"text":"Approximating spanning tree congestion on graphs with polylog degree","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7021069$8D406BB9-377F-45CB-99E2-E8E407A436EA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"21af41c5f0794682c3169903e1c75504b48adba7","datavalue":{"value":"10.1007/978-3-031-63021-7_38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7021069$FF104739-A6F6-41FB-9008-7B214979807B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"aa63f642e27dbdecb94bd4e745870cb22f9dbc7d","datavalue":{"value":{"entity-type":"item","numeric-id":372973,"id":"Q372973"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7021069$E22E9F15-568D-43F0-953D-0458FFB62C5D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"954c666eb6b190bec4b629d834323b8518a7b288","datavalue":{"value":{"time":"+2025-02-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7021069$A621802E-0932-49F9-974D-9634A14CF101","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7021069$A63EC92D-938D-4BAD-8B65-98D3BB891873","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7021069$5D6C6099-1BE0-425E-9D75-70DE1ECD7143","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"30799e13611e1f2d7e6af3c687b7a8c078cd0c0d","datavalue":{"value":"7990676","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7021069$BBFEFD09-2419-4E07-8ADD-230786E76E06","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"21d4ac35a900f75fa73f592b8de07f52d8c3da17","datavalue":{"value":"graph sparsification","type":"string"},"datatype":"string"},"type":"statement","id":"Q7021069$FA1DAE4B-89AB-4B25-B45C-FDAA443ADBCC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"697c3dfef94cf16f084d4c2006149e0eeac614ad","datavalue":{"value":"congestion","type":"string"},"datatype":"string"},"type":"statement","id":"Q7021069$8D018579-79E6-463D-94DD-78D696EB1D60","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"61f168965e31defe93185084bddb5a1681ce59f8","datavalue":{"value":"bisection","type":"string"},"datatype":"string"},"type":"statement","id":"Q7021069$D2CC7CBD-2088-4FEA-AA98-02BC95D90E0B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"849b7a0d6519fee636943d9bde0b8b557d98cf60","datavalue":{"value":"spanning tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q7021069$3A19B7F3-0273-44A5-88AF-D79F0DCB9769","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":"Q7021069$C2F436B3-7CA9-4491-9D05-A39E20A9E904","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximating spanning tree congestion on graphs with polylog degree","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Approximating_spanning_tree_congestion_on_graphs_with_polylog_degree"}}}}}