{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:31Z","timestamp":1720640851845},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80185-4","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T07:08:52Z","timestamp":1114931332000},"page":"278-280","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Perfection, Imperfection, and Graph Entropy"],"prefix":"10.1016","volume":"5","author":[{"given":"G\u00e1bor","family":"Simonyi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80185-4_BIB1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02122693","article-title":"Entropy splitting for antiblocking corners and perfect graphs","volume":"10","author":"Csisz\u00e1r","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/S1571-0653(05)80185-4_BIB2","author":"Gerke","year":"1999","journal-title":"Graph imperfection L, submitted"},{"key":"10.1016\/S1571-0653(05)80185-4_BIB3","doi-asserted-by":"crossref","unstructured":"J. Kahn and J. H. Kim, Entropy and sorting, Proc. 24th Annual ACM Symposium on the Theory of Computing, 178-187.","DOI":"10.1145\/129712.129731"},{"key":"10.1016\/S1571-0653(05)80185-4_BIB4","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs, in \u201cTransactions of the 6th Prague Conference on Information Theory, etc.,\u201d 1971","author":"K\u00f6rner","year":"1973","journal-title":"Academia, Prague"},{"key":"10.1016\/S1571-0653(05)80185-4_BIB5","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1137\/0607062","article-title":"Fredman-Koml\u00f3s bounds and information theory","volume":"7","author":"K\u00f6rner","year":"1986","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"10.1016\/S1571-0653(05)80185-4_BIB6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1137\/0401008","article-title":"Graphs that split entropies","volume":"1","author":"K\u00f3rner","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S1571-0653(05)80185-4_BIB7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s004930070022","article-title":"Graph pairs and their entropies: modularity problems","volume":"20","author":"K\u00f6rner","year":"2000","journal-title":"Combinatorica"},{"key":"10.1016\/S1571-0653(05)80185-4_BIB8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01204721","article-title":"Perfect couples of graphs","volume":"12","author":"K\u00f6rner","year":"1992","journal-title":"Combinatorica"},{"key":"10.1016\/S1571-0653(05)80185-4_BIB9","unstructured":"C. McDiarmid, Graph imperfection and channel assignment, manuscript, to be published in: Perfect Graphs (B. Reed and J. Ramirez-Alfonsin eds.), John Wiley and Sons."},{"key":"10.1016\/S1571-0653(05)80185-4_BIB10","doi-asserted-by":"crossref","unstructured":"G. Simonyi, Graph entropy: A survey, in: Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 20, (W. Cook, L. Lov\u00e1sz, P. D. Seymour eds.), AMS, 399-441.","DOI":"10.1090\/dimacs\/020\/08"},{"key":"10.1016\/S1571-0653(05)80185-4_BIB11","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1006\/jctb.1996.0024","article-title":"Entropy splitting hypergraphs","volume":"66","author":"Simonyi","year":"1996","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S1571-0653(05)80185-4_BIB12","unstructured":"G. Simonyi, Perfect graphs and graph entropy. An updated survey, to be published in: Perfect Graphs (B. Reed and J. Ramirez-Alfonsin eds.), John Wiley and Sons."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801854?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801854?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T07:28:48Z","timestamp":1550388528000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":12,"alternative-id":["S1571065305801854"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80185-4","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}