{"@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/Q5230293","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q5230293","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q5230293","kernelVersion":"v1","immutable":true,"modified":"2025-05-06T19:31:13Z","fdo:hasComponent":[{"@id":"#fulltext","componentId":"fulltext","mediaType":"application/pdf"}]},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q5230293","name":"Fine-grained complexity for sparse graphs","headline":"Fine-grained complexity for sparse graphs","description":"scientific article; zbMATH DE number 7097000","url":"https://portal.mardi4nfdi.de/entity/Q5230293","datePublished":"2019-08-22","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2788737"},{"@id":"https://portal.mardi4nfdi.de/entity/Q290237"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5230271"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1145/3188745.3188888","url":"https://doi.org/10.1145/3188745.3188888"},"sameAs":["https://doi.org/10.1145/3188745.3188888"]},"provenance":{"prov:generatedAtTime":"2025-05-06T19:31:13Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}