{"@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/Q4337653","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4337653","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4337653","kernelVersion":"v1","immutable":true,"modified":"2025-12-25T12:06:47Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4337653","name":"On the Complexity of Finding a Minimum Cycle Cover of a Graph","headline":"On the Complexity of Finding a Minimum Cycle Cover of a Graph","description":"scientific article; zbMATH DE number 1012890","url":"https://portal.mardi4nfdi.de/entity/Q4337653","datePublished":"1997-05-26","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q228790"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q84798"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1137/S0097539794267255","url":"https://doi.org/10.1137/S0097539794267255"},"sameAs":["https://doi.org/10.1137/S0097539794267255"]},"provenance":{"prov:generatedAtTime":"2025-12-25T12:06:47Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}