{"entities":{"Q2768451":{"pageid":2779190,"ns":120,"title":"Item:Q2768451","lastrevid":79227584,"modified":"2026-05-06T13:26:16Z","type":"item","id":"Q2768451","labels":{"en":{"language":"en","value":"An efficient algorithm for the maximum distance problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1699530"}},"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":"Q2768451$99780634-89D0-4D79-82C7-7FBC307365EB","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"26116a2595934d36b56461f5b3178b011e0f009d","datavalue":{"value":"0990.68141","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768451$449B65A2-2124-4AD6-A05B-53B6D1797885","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9133fed25625b9956364aef240d4b66cb3850b3c","datavalue":{"value":{"entity-type":"item","numeric-id":2768450,"id":"Q2768450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2768451$3A319398-1731-4679-ABFC-DFF91169C869","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"22e17fffa644ae9f618754e26357d6dbd53b7382","datavalue":{"value":{"time":"+2002-04-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2768451$0BCB21D7-7397-4483-B105-36C8A205031C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"8f317b92afb57d93e4789e852197fb592e097911","datavalue":{"value":"https://eudml.org/doc/121932","type":"string"},"datatype":"url"},"type":"statement","id":"Q2768451$9FCC5A7B-17C2-49C5-ACD3-26B71ADF2ED7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P205","hash":"dc0549dfea953e57651b1d96356526eacb6089a5","datavalue":{"value":"http://www.emis.de/journals/DMTCS/volumes/abstracts/dm040218.abs.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q2768451$BD7DF6A7-FFC9-4A35-883E-B18DF97AECA2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"73dccdfb072fb026a86af92d74fe625efeb2b023","datavalue":{"value":"68T35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768451$B1D18C03-53F9-4662-A1D9-B9B6C1401AEC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"657b2bc34d8753c58470fb63d2422c1e0c880e05","datavalue":{"value":"1699530","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768451$5FDCAFD1-DE48-46E6-B527-70EDE9F5B580","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bdf4dc3db86d44e89a36d3ec12340c2571d04f06","datavalue":{"value":"graph theory","type":"string"},"datatype":"string"},"type":"statement","id":"Q2768451$032F0632-3DD2-48EB-8617-6BA2CC26CD18","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3e2fc9fe2fd76509ff07c6232565d587dc25e73a","datavalue":{"value":"analysis of algorithms and data structures","type":"string"},"datatype":"string"},"type":"statement","id":"Q2768451$78AE59F2-C9F5-4441-AB77-BD464F25B57C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"83792030c8f7220278a9f0920edf4db7fbff3d5d","datavalue":{"value":"maximum distance problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q2768451$09D524B1-06DF-484F-8BF8-4536ED24773C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"53eef58615f027b6027e364cb066d3d7469bdd18","datavalue":{"value":"temporal reasoning","type":"string"},"datatype":"string"},"type":"statement","id":"Q2768451$E97E83ED-DEC6-4B83-A53C-4E3E1AAACB7A","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":"Q2768451$580EB096-D72D-49CD-974E-B73C7ECC909E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ad04188b2d168009095eaea87756f2abf11010c8","datavalue":{"value":{"text":"An efficient algorithm for the maximum distance problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2768451$07E347FC-D3E3-4969-A7E3-5F97E8411926","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"1c130b4c249cf6a7198c786d015c9f03c3441d6e","datavalue":{"value":{"entity-type":"item","numeric-id":6599785,"id":"Q6599785"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2768451$07D6ECEB-D2C9-4184-A39E-097CDE4D0653","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"510bc063cfd512aa331c95d849479a2335d3b69c","datavalue":{"value":{"entity-type":"item","numeric-id":1855212,"id":"Q1855212"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6a06f84de923993ae5ad9ffd0a36272e184bb90f","datavalue":{"value":{"amount":"+0.7296542525291443","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2768451$B575000E-7221-4C07-899A-354EF150AC43","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c2d3173dad408bb3dc1e7a6f4310c56c088c1338","datavalue":{"value":{"entity-type":"item","numeric-id":4386938,"id":"Q4386938"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6a06f84de923993ae5ad9ffd0a36272e184bb90f","datavalue":{"value":{"amount":"+0.7296542525291443","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2768451$3C04E7FC-27B6-406D-BD63-AA9861449FEC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4e9d02cba6069201bed2458ce10093fab68e2a18","datavalue":{"value":{"entity-type":"item","numeric-id":2807847,"id":"Q2807847"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"9e1365071dee364feac34df8e09df16c920d5e82","datavalue":{"value":{"amount":"+0.715372622013092","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2768451$8A970316-7BB7-4B11-BF63-573933C0AE3D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c7e4e98e760c324b6f17039b5808779ee8ae3d0c","datavalue":{"value":{"entity-type":"item","numeric-id":4475124,"id":"Q4475124"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e42036c120a065f11740d677e65b21749b7a1796","datavalue":{"value":{"amount":"+0.7150157690048218","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2768451$DF099A5B-558E-44DD-9AAF-DD838AA00172","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"907d0d29b618213dc3341ab1c867d5c3c09abefe","datavalue":{"value":{"entity-type":"item","numeric-id":1204871,"id":"Q1204871"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3cb4743ce1aedcff146a8368e95ac2ec3865e01c","datavalue":{"value":{"amount":"+0.7104437351226807","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2768451$33B05C18-99D8-484A-A82A-66BEED3E564B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An efficient algorithm for the maximum distance problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_efficient_algorithm_for_the_maximum_distance_problem"}}}}}