{"entities":{"Q2857263":{"pageid":2867983,"ns":120,"title":"Item:Q2857263","lastrevid":42278537,"modified":"2025-06-04T05:03:38Z","type":"item","id":"Q2857263","labels":{"en":{"language":"en","value":"Algorithms for minimum flows. Dynamic tree implementations"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6221721"}},"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":"Q2857263$576D85DD-DA80-45CA-88A5-FB0E7A4E793B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4d3dfe69a3b7df4cbf36d199434b7ffcee359803","datavalue":{"value":"1289.90042","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2857263$35524068-353F-4A84-9628-8EBB877865B4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3c19e9dc7d8b08a50c367f9006e2187961b7b467","datavalue":{"value":{"entity-type":"item","numeric-id":2857262,"id":"Q2857262"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2857263$EFD423FB-303E-47D5-AC1A-B1196AFB6DDC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fab3b532b6475f917a23a9b5947ae17593a8d143","datavalue":{"value":{"time":"+2013-10-31T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2857263$C68511F1-46CC-4B72-9286-6FFDA5BA4D00","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2857263$FE379640-03D9-489B-A369-AAD43FF5E414","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"94ec13c91c825733087a1e6b921f0abcbfe9c6d6","datavalue":{"value":"6221721","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2857263$69F69321-6F50-48D7-8880-9A83A94B7B89","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9527ea6265f63439699edc7d3ec8cd45a55d81c3","datavalue":{"value":"network flow","type":"string"},"datatype":"string"},"type":"statement","id":"Q2857263$C960D703-291B-4771-B9A2-9D47F770E84A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ac97c6b3638af3c2a58df5d6631d7d579e8a48ac","datavalue":{"value":"network algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q2857263$2093D01E-4FA4-4D7B-B6F9-195299FBA521","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"65314903edcc3c3360802659a4676eb4d6e43788","datavalue":{"value":"minimum flow problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q2857263$08C91A02-18A3-4860-AC1B-067914D64474","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"847f650824b9f3e5fb89e7f8c1393fbc80f7847f","datavalue":{"value":"dynamic tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q2857263$1C439F1B-CE9B-4C41-8B82-4367837F29F9","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":"Q2857263$67F15EAB-697B-423A-9AED-5A823AE1525C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6fc106ff4ce9733ea8a6b50a95f90467ce55118d","datavalue":{"value":{"text":"Algorithms for minimum flows. Dynamic tree implementations","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2857263$8DBC25BB-C111-4413-89E6-30D2CA470285","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"1d572c25ec67c5551f698daf7bd098f09cb25037","datavalue":{"value":{"entity-type":"item","numeric-id":6771398,"id":"Q6771398"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2857263$688F802E-97ED-410A-BFFF-5CA03D6F734A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2857263","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2857263"}}}}}