{"entities":{"Q1313724":{"pageid":1324474,"ns":120,"title":"Item:Q1313724","lastrevid":68720511,"modified":"2026-04-13T01:39:31Z","type":"item","id":"Q1313724","labels":{"en":{"language":"en","value":"Efficient algorithms for finding the most vital edge of a minimum spanning tree"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 500523"}},"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":"Q1313724$BC13D4B8-4C5A-4158-9E08-34B32E44B820","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"daef7ce7a313bb6ee4c3b6af61d2f0a13df4b6d5","datavalue":{"value":{"text":"Efficient algorithms for finding the most vital edge of a minimum spanning tree","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1313724$7FD9DA9C-837C-4AAC-B075-8000FEB793C1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4c119fa4a816564a328a92e9d829bc43a8518db3","datavalue":{"value":"0942.68579","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313724$EA0FA574-DC3E-4316-8CF8-C8E8AC30A7F0","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b7dcb1a84a5d0b21b45d35169556e1d55e998d35","datavalue":{"value":"10.1016/0020-0190(93)90082-K","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313724$12BE5D29-B36A-450C-8BE0-B8542D3516CF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"91a1f2737801307138843275dd674097dddb4f46","datavalue":{"value":{"entity-type":"item","numeric-id":293141,"id":"Q293141"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313724$858E308B-FB2E-45B9-A5F3-5A462D3AEF13","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"857bf70e7d30bebc99244cb54d69e95a358f4fc1","datavalue":{"value":{"entity-type":"item","numeric-id":202561,"id":"Q202561"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313724$389CA6A7-68F9-4E16-AA15-595412B801D5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313724$8F1FC4FD-3F59-466B-AD25-6A7513ED39AB","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"97fbaa74108aac30250cdf29ad1831a2e82622ab","datavalue":{"value":{"time":"+2000-08-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1313724$A0DB0293-922E-4739-BCB4-E5411E055A61","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313724$8C34AC05-F140-4D70-BC8B-2A2FF652D381","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313724$7BD2E7B1-6FEB-4C9D-AB0C-D5B55B6CBBAA","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"af32c7f86e29fcb8750f48abf463fd73716c2593","datavalue":{"value":"500523","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313724$D6451B33-2AFB-4753-8176-9724D18E9C44","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":"Q1313724$08D873B1-9AB5-4381-A790-C1FAC611FB13","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"6704ccbb4c75ac5e07412c0181b63f464f1b7a0e","datavalue":{"value":{"entity-type":"item","numeric-id":5225293,"id":"Q5225293"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313724$31A5BA92-C018-4516-ADBB-7D47191BCBA1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"97424c713ff1c1880e6b90735151bdb046a214dd","datavalue":{"value":{"entity-type":"item","numeric-id":1183410,"id":"Q1183410"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313724$9DD1D471-BA71-4985-881B-63F32CD4FCB4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"cb4bb8ecc53694b95953f765733c32a872021462","datavalue":{"value":{"entity-type":"item","numeric-id":3048273,"id":"Q3048273"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313724$4FE1EDF1-DC21-4B12-BF74-2ADF8FFD68F4","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"49f0ef09f87250dd7167a282950fa1be4cbd432c","datavalue":{"value":"https://doi.org/10.1016/0020-0190(93)90082-k","type":"string"},"datatype":"url"},"type":"statement","id":"Q1313724$8C7AC102-C803-404C-8D79-9FC3E3D53CC0","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"97f75d0f6bfe5063ab884b96a5cf24e08c35705e","datavalue":{"value":"W2069416867","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313724$815B7024-B557-4BC5-BFC5-5DBACBAB47C2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient algorithms for finding the most vital edge of a minimum spanning tree","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Efficient_algorithms_for_finding_the_most_vital_edge_of_a_minimum_spanning_tree"}}}}}