{"@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/Q3003279","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3003279","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q3003279","kernelVersion":"v1","immutable":true,"modified":"2026-01-17T11:33:05Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q3003279","name":"Branch-cut-and-propagate for the maximum \\(k\\)-colorable subgraph problem with symmetry","headline":"Branch-cut-and-propagate for the maximum \\(k\\)-colorable subgraph problem with symmetry","description":"scientific article; zbMATH DE number 5900034","url":"https://portal.mardi4nfdi.de/entity/Q3003279","datePublished":"2011-05-26","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q665999"},{"@id":"https://portal.mardi4nfdi.de/entity/Q284837"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3003269"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/978-3-642-21311-3_11","url":"https://doi.org/10.1007/978-3-642-21311-3_11"},"sameAs":["https://doi.org/10.1007/978-3-642-21311-3_11"]},"provenance":{"prov:generatedAtTime":"2026-01-17T11:33:05Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}