{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q6492091","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q6492091","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q6492091","kernelVersion":"v1","immutable":true,"modified":"2026-03-26T17:14:39Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q6492091","name":"An Efficient Algorithm for All-Pairs Bounded Edge Connectivity","headline":"An Efficient Algorithm for All-Pairs Bounded Edge Connectivity","description":"scientific article; zbMATH DE number 7837706","url":"https://portal.mardi4nfdi.de/entity/Q6492091","datePublished":"2024-04-24","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q497461"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5090423"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96582"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/S00453-023-01203-2","url":"https://doi.org/10.1007/S00453-023-01203-2"},"sameAs":["https://doi.org/10.1007/S00453-023-01203-2"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5091155"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5395727"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2848198"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4607951"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5111405"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4629955"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4856179"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2946426"}]},"provenance":{"prov:generatedAtTime":"2026-03-26T17:14:39Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}