{"entities":{"Q557536":{"pageid":559303,"ns":120,"title":"Item:Q557536","lastrevid":62728065,"modified":"2026-04-11T08:03:05Z","type":"item","id":"Q557536","labels":{"en":{"language":"en","value":"Irredundant algorithms for traversing directed graphs: the nondeterministic case"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2183792"}},"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":"Q557536$4F11B771-1771-4AB5-9587-00952FEC5C56","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"805ad4ac783ebc821a7b56487c63661fe3d42c0c","datavalue":{"value":{"text":"Irredundant algorithms for traversing directed graphs: the nondeterministic case","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q557536$5CA350FB-149D-4146-BE16-450DB6AE771F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2f16c63b42dafaef6e972bc28b22da93890cdaf3","datavalue":{"value":"1124.68399","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q557536$6E024624-9CB0-49AA-A01D-6AE6EDEFC308","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"72ecc45d8ae9e844e6bc78f40e20c0ccd734d939","datavalue":{"value":"10.1023/B:PACS.0000013436.72070.95","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q557536$1DA7C0E6-35D1-4295-99AD-714560EDDBB5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9153f57b49379c8f42a6fee983336120467fb8fa","datavalue":{"value":{"entity-type":"item","numeric-id":551798,"id":"Q551798"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q557536$43876036-B493-4102-A81E-FB2492F8345F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f3994b3ea7b242f980d845d7f38f3a45e589bc28","datavalue":{"value":{"entity-type":"item","numeric-id":592710,"id":"Q592710"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q557536$79ABB7C2-EF19-4D67-ACE1-7E7F46E46440","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"be953c7743ad681cffb55322e552c5990c03cfb7","datavalue":{"value":{"entity-type":"item","numeric-id":174054,"id":"Q174054"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q557536$8A7AD73F-102E-432D-8624-3582246F94F6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3be35b99bc40d25914143aa31268a19fcdde1b9d","datavalue":{"value":{"time":"+2005-06-30T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q557536$A05B1915-4FD1-4093-A291-CA4EE61D1DEF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q557536$692978E7-7B8B-4EAF-BB5C-B95AA8C0E2A5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"83bbf0b299346afb89579c3d6a26f4aedc76938a","datavalue":{"value":"05C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q557536$4A123166-1C91-4300-941B-92BCCA9D4CAC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"79b3bc872b6637176b35f9e46ac855febbf884f5","datavalue":{"value":"68W05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q557536$DA567B08-412E-4A39-A2AA-19ABE93484C6","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"da299f219750d244d9db0bcdd264561066ef3978","datavalue":{"value":"2183792","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q557536$C1D94FB3-2E09-41E4-AE68-3970E5691DCE","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":"Q557536$B809EAB9-2553-4B0C-A5AF-75148994FA1B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"0a070f8b01d92ad3a1c7c60ad34c6005d9fdc822","datavalue":{"value":"https://doi.org/10.1023/b:pacs.0000013436.72070.95","type":"string"},"datatype":"url"},"type":"statement","id":"Q557536$5F1832E6-490F-4BFF-8FEB-2848DF89B645","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a011a8c3a82dbfaf87022b9a13527edf01b69a30","datavalue":{"value":"W1992286012","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q557536$B7260897-F159-4E20-BFB0-8D35A270E6D3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Irredundant algorithms for traversing directed graphs: the nondeterministic case","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Irredundant_algorithms_for_traversing_directed_graphs:_the_nondeterministic_case"}}}}}