{"entities":{"Q5552100":{"pageid":7581660,"ns":120,"title":"Item:Q5552100","lastrevid":92645681,"modified":"2026-06-05T02:18:26Z","type":"item","id":"Q5552100","labels":{"en":{"language":"en","value":"The Shortest Connected Graph Through Dynamic Programming Technique"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3265672"}},"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":"Q5552100$D1F1DD09-8C2C-40CC-8175-ADF7954105CC","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"bb619ea47373c604877b3a11aecc0507b449938d","datavalue":{"value":"0165.57403","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5552100$D52BDE52-B890-45C0-8994-7FEFFFDC28F0","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"fd00d80abadb1920de310fca45877564801155fd","datavalue":{"value":"10.2307/2689138","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5552100$533B8915-C8F3-4B4D-AD45-E50C13CCB0C0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1c70290a9512dfc1c7a03b9050a54926ef229db7","datavalue":{"value":{"entity-type":"item","numeric-id":3275355,"id":"Q3275355"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5552100$22AB80DA-F5FC-4D5C-ABA6-38D61BC33E5B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6bcd0c6533d0b4bb1cdde7856dd881251c3318aa","datavalue":{"value":{"entity-type":"item","numeric-id":2171580,"id":"Q2171580"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5552100$D45081CC-19B2-406E-A46D-6108DE69BEE0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6b7d902a691bf065ccbbbe3c070a7f8cb1f53366","datavalue":{"value":{"time":"+1968-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":"Q5552100$1933B19C-F1DC-4E4B-8AE8-0078359D78DE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f722bf9705ca2bf39e2a579691ba621f39231885","datavalue":{"value":"3265672","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5552100$3DF96F0A-73AB-42F8-9618-4265B08068EB","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"96a810129b114a6942442a7fc510c6873bd89ff8","datavalue":{"value":"topology","type":"string"},"datatype":"string"},"type":"statement","id":"Q5552100$9A2FE18F-6973-47A2-A22B-57E76CD1DAB3","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":"Q5552100$CB8B0633-6C7D-46E0-9961-85C321277656","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"491447b2cce8465360a4ca088a04f3c82f99308b","datavalue":{"value":"https://doi.org/10.2307/2689138","type":"string"},"datatype":"url"},"type":"statement","id":"Q5552100$EE7F5879-EC35-46B5-A3F8-FD1B8C8FB817","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"e56a07a7ac211543ad486bd30d8135fdcc6198b8","datavalue":{"value":"W4246206958","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5552100$091E00F1-8563-421A-A6AC-0184853AA076","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b0d2ef430d1a8d286c4a45c56885ee3653ab55ac","datavalue":{"value":{"text":"The Shortest Connected Graph Through Dynamic Programming Technique","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5552100$FBF0F48E-2E53-47D8-8207-B5323F56A237","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The Shortest Connected Graph Through Dynamic Programming Technique","badges":[]}}}}}