{"entities":{"Q1139941":{"pageid":1150690,"ns":120,"title":"Item:Q1139941","lastrevid":66921108,"modified":"2026-04-12T13:44:38Z","type":"item","id":"Q1139941","labels":{"en":{"language":"en","value":"Algorithmus 41. Ein Algorithmus zum vollst\u00e4ndigen Durchlaufen eines ungerichteten, zusammenh\u00e4ngenden Graphen"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3677212"}},"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":"Q1139941$1516EEB6-A760-4AB5-90B4-D7BF7282F5C7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7bffc2ef930aeeadfd28f5a5ba32bdf08051b9ee","datavalue":{"value":{"text":"Algorithmus 41. Ein Algorithmus zum vollst\u00e4ndigen Durchlaufen eines ungerichteten, zusammenh\u00e4ngenden Graphen","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1139941$A0781363-65FE-4271-B4B8-00B945485A31","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"09f7df7d30512b93a315a3290be9c97d83d78dd2","datavalue":{"value":"0434.68045","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1139941$A5BE553A-3C66-428E-B373-6617A0976E47","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"aa6328e08d281fd7539e8e518f9d7f2eea0d89ee","datavalue":{"value":"10.1007/BF02281731","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1139941$F8A98348-D216-4C3A-973B-80C9509D7081","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c4346fb17f48b936f61de0317a6c206df8f321d0","datavalue":{"value":{"entity-type":"item","numeric-id":1139939,"id":"Q1139939"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139941$CF5022F6-285E-49D9-AEA9-D1395909C96C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"475f007a2a1fc48dd933a3245448a0c2405b4351","datavalue":{"value":{"entity-type":"item","numeric-id":1139940,"id":"Q1139940"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139941$9689A7F3-7D42-42B1-B412-F1919B0046D9","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"b79ece58f33b59758a066cb6b9ee149bab3a2c9a","datavalue":{"value":{"entity-type":"item","numeric-id":167642,"id":"Q167642"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1139941$1AC8C131-50C6-4507-9011-24564B121BFC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"56afe75e154439409929c71e0e459d1542811b6e","datavalue":{"value":{"time":"+1980-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":"Q1139941$82CB8729-06A1-4FE4-92B4-1A88AE1B88A2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1139941$D849A641-7D67-456F-BE35-291250166A39","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"86458f21530eac6f0ce67bd20ea9656368e3f2c8","datavalue":{"value":"3677212","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1139941$8EF069FE-90CC-40D3-8352-CE174E03303F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1d295a8f8bed54ba688eee177e3821467142b71e","datavalue":{"value":"algorithm for the traversal of an undirected connected graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q1139941$A6BB7FCC-4065-4E6C-BAE0-5788540E2EF1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a02a77b2f27680f624d8aa3b55cd1c826496740b","datavalue":{"value":"principle of the thread of Ariadne","type":"string"},"datatype":"string"},"type":"statement","id":"Q1139941$077131FE-0A16-42F0-B4F8-F20F3FE109E5","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":"Q1139941$DEC1238F-0691-4BD9-93F9-15D17ABC6CC5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Algorithmus 41. Ein Algorithmus zum vollst\u00e4ndigen Durchlaufen eines ungerichteten, zusammenh\u00e4ngenden Graphen","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Algorithmus_41._Ein_Algorithmus_zum_vollst%C3%A4ndigen_Durchlaufen_eines_ungerichteten,_zusammenh%C3%A4ngenden_Graphen"}}}}}