{"entities":{"Q6990320":{"pageid":21444924,"ns":120,"title":"Item:Q6990320","lastrevid":76364109,"modified":"2026-04-23T19:59:17Z","type":"item","id":"Q6990320","labels":{"en":{"language":"en","value":"Approximation algorithms for the edge-disjoint paths problem via Raecke decompositions"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8033983"}},"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":"Q6990320$D5CFA6C4-CDB0-4BB0-B1C3-5B7A71557553","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"57e6bf33251a7f5e1d9675584b19a964355badc2","datavalue":{"value":{"text":"Approximation algorithms for the edge-disjoint paths problem via Raecke decompositions","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6990320$C2EC1A7F-ED5C-4348-B4B4-C66ED1C198DD","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3b7a5f7aab4e61ef97d0d837a6626bd841a1c8b1","datavalue":{"value":"10.1109/FOCS.2010.33","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6990320$5F6555F8-4B2E-4E4E-8A42-D0D0BC85B330","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3e8bbffefd0dbcf64a3b305a130ac56fa48950b5","datavalue":{"value":{"entity-type":"item","numeric-id":2219707,"id":"Q2219707"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6990320$1B67B505-30C6-4292-A9AE-08ED9234437E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1e0d6617dd626682cda2f457b20b85a92c8d2d47","datavalue":{"value":{"time":"+2025-04-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6990320$AE6C43D7-486E-49F4-BFC3-677F37E31A31","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62a49b155c9af634e6c3562b1547da1f7c08791a","datavalue":{"value":"68-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6990320$E0C762CB-E8C2-458D-B709-7BDD63E984C0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"57f167c32409cd84dad7e725a6344d78daf6bdb3","datavalue":{"value":"05-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6990320$47A4D8C6-1513-4EBE-BFEC-EFBC42327628","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"53aeb1fcbd2f0d31715f68f8c0d9430ea394bc21","datavalue":{"value":"94-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6990320$25B64FAD-4B75-4938-9E14-FD0E02AA3CFB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3b13e2658ff9ff57e162c9e4d60e4a88d4b464f6","datavalue":{"value":"8033983","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6990320$2D59D490-F8FF-43E1-825A-B1B5725B8BFD","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":"Q6990320$0519B333-1077-4E5C-BBA7-1E9DDCF42EA4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximation algorithms for the edge-disjoint paths problem via Raecke decompositions","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Approximation_algorithms_for_the_edge-disjoint_paths_problem_via_Raecke_decompositions"}}}}}