{"@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/Q2113349","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2113349","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2113349","kernelVersion":"v1","immutable":true,"modified":"2026-04-01T03:11:40Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2113349","name":"The path minimises the average size of a connected induced subgraph","headline":"The path minimises the average size of a connected induced subgraph","description":"scientific article; zbMATH DE number 7488426","url":"https://portal.mardi4nfdi.de/entity/Q2113349","datePublished":"2022-03-14","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q383336"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q175483"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.DISC.2022.112799","url":"https://doi.org/10.1016/J.DISC.2022.112799"},"sameAs":["https://doi.org/10.1016/J.DISC.2022.112799"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5109058"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4646947"},{"@id":"https://portal.mardi4nfdi.de/entity/Q403359"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1838491"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4616101"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3318794"},{"@id":"https://portal.mardi4nfdi.de/entity/Q6055930"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2664553"},{"@id":"https://portal.mardi4nfdi.de/entity/Q965244"}]},"provenance":{"prov:generatedAtTime":"2026-04-01T03:11:40Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}