{"entities":{"Q4180383":{"pageid":6209984,"ns":120,"title":"Item:Q4180383","lastrevid":89321333,"modified":"2026-06-04T16:58:33Z","type":"item","id":"Q4180383","labels":{"en":{"language":"en","value":"Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3616465"}},"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":"Q4180383$4DB39AB9-A0A4-4DEC-9F7D-8DAA0B446474","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b2d7739249b3c76639d88f08700ae2c96dd63766","datavalue":{"value":{"text":"Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4180383$DF76A6C4-358A-445E-80CF-FE894451F4DE","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"5b72f562f4cd3763a9f58366a4c99578a6aa9ff4","datavalue":{"value":"0397.05031","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4180383$9D7AE8D4-13AB-4836-9B89-56B43AF9A202","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"bfc5dfea3f8389d31399b2d36de2af0df20b3d86","datavalue":{"value":"10.1109/TR.1979.5220473","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4180383$484E4393-E297-4E48-822C-DEC6C746BDDE","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"cb524409e4581763231eae83c024109df0b69451","datavalue":{"value":{"entity-type":"item","numeric-id":3026098,"id":"Q3026098"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4180383$D6C4035E-096A-47F0-8B30-F09FC8395797","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0b87f78dda5694898cc127305eecf88680ce6c83","datavalue":{"value":{"time":"+1979-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":"Q4180383$1A725311-96E0-443E-B651-07C772F89DA0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1de0493fc6f7fe4361a54e7c2f5546e4ec52adf0","datavalue":{"value":"05C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4180383$E73052F7-7FE6-4A92-BE79-881EAD731F75","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"e35cfda1c439de499de525a8a9009114d934bb37","datavalue":{"value":"05C99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4180383$9DB57B35-BA8D-4CC3-8249-9D56CE953805","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5554b9c844f173ce8299bcb1bb0c8b42f6b4a0be","datavalue":{"value":"05C40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4180383$1E81CC8E-5E60-4C4E-9C45-59EFF450B402","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"2f9920e258389d79a7ef76ef96a77d2e9cc60267","datavalue":{"value":"05-04","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4180383$B7EE86AF-72A2-42D6-BAFE-54316AE34343","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"92978773f03ebe5a924d43ab0a10f4c7e455a6ee","datavalue":{"value":"3616465","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4180383$3046B0B0-2CC3-4484-998B-394F30F13B28","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1988791eb858774c9e6197a61fee63e938576a0e","datavalue":{"value":"Enumeration Algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q4180383$7F9249A4-EAB7-4560-933D-52A1D86BFE2D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1bcc90222c09fe74ddd516a68e2dae39bd8e7bae","datavalue":{"value":"All Minimal Cut-Sets for a Node Pair in a Graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q4180383$063C5C8A-1B28-4072-A216-BD405F532C62","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"642d05aa07bffaf89ed1d9e50aa855a942bd5554","datavalue":{"value":"Connected Subgraphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q4180383$C17ECE5B-0E9A-4039-BFA1-947B8EC35E36","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":"Q4180383$FA86FE31-A7E2-4EB7-A2EF-793503D189E1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph","badges":[]}}}}}