{"@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/Q765324","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q765324","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q765324","kernelVersion":"v1","immutable":true,"modified":"2026-01-18T05:46:08Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q765324","name":"A revised algorithm for searching for all defective edges in a graph","headline":"A revised algorithm for searching for all defective edges in a graph","description":"scientific article; zbMATH DE number 6015775","url":"https://portal.mardi4nfdi.de/entity/Q765324","datePublished":"2012-03-19","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q242885"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96294"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.DAM.2011.08.004","url":"https://doi.org/10.1016/J.DAM.2011.08.004"},"sameAs":["https://doi.org/10.1016/J.DAM.2011.08.004"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3994535"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3964573"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1315459"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1309810"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2486071"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1348382"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1917312"}]},"provenance":{"prov:generatedAtTime":"2026-01-18T05:46:08Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}