{"id":"https://openalex.org/W2172202720","doi":"https://doi.org/10.1109/isit.2010.5513270","title":"Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem","display_name":"Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2172202720","doi":"https://doi.org/10.1109/isit.2010.5513270","mag":"2172202720"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513270","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/74017","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025450606","display_name":"Soheil Feizi","orcid":"https://orcid.org/0000-0003-0944-8242"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Soheil Feizi","raw_affiliation_strings":["RLE, MIT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RLE, MIT, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075370174","display_name":"Muriel M\u00e9dard","orcid":"https://orcid.org/0000-0003-4059-407X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Muriel Medard","raw_affiliation_strings":["RLE, MIT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RLE, MIT, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7727,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.8577081,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"116","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.6212431788444519},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6132189035415649},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5425550937652588},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5284818410873413},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.48853859305381775},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4743824303150177},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4659377634525299},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.43478187918663025},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33866214752197266},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1539212465286255},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11011317372322083}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6212431788444519},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6132189035415649},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5425550937652588},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5284818410873413},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.48853859305381775},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4743824303150177},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4659377634525299},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.43478187918663025},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33866214752197266},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1539212465286255},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11011317372322083},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/isit.2010.5513270","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.208.198","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.198","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mit.edu/%7Emedard/newpapers/4.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.208.5174","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.5174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/medard/www/2010papers/Cases%20Where%20Finding%20the%20Minimum.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.937.2253","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.937.2253","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Soheil_Feizi/publication/224157513_Cases_where_finding_the_minimum_entropy_coloring_of_a_characteristic_graph_is_a_polynomial_time_problem/links/0c9605254c05a71fac000000.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.952.531","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.952.531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Soheil_Feizi/publication/224157513_Cases_where_finding_the_minimum_entropy_coloring_of_a_characteristic_graph_is_a_polynomial_time_problem/links/0c9605254c05a71fac000000.pdf?origin%3Dpublication_detail","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/74017","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/74017","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/74017","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/74017","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2021889595","https://openalex.org/W2071801393","https://openalex.org/W2137993161","https://openalex.org/W2164651000","https://openalex.org/W2168920751","https://openalex.org/W2169744769","https://openalex.org/W6655845788"],"related_works":["https://openalex.org/W4291316360","https://openalex.org/W4311345810","https://openalex.org/W151506147","https://openalex.org/W2793500002","https://openalex.org/W4385455827","https://openalex.org/W3169197204","https://openalex.org/W183100298","https://openalex.org/W2585997002","https://openalex.org/W1542397451","https://openalex.org/W4297911588"],"abstract_inverted_index":{"In":[0,88,113,159,205],"this":[1,71,116,130,217],"paper,":[2,131],"we":[3,132,164,208],"consider":[4],"the":[5,9,32,37,47,53,97,107,137,148,195],"problem":[6,29,35,56,121,218],"of":[7,13,39,42,52,109,161,187],"finding":[8,115,147],"minimum":[10,98,149,196],"entropy":[11,99,150,197],"coloring":[12,100,102,117,151,198],"a":[14,40,75,84,110,168,214],"characteristic":[15,111,138,182],"graph":[16],"under":[17,63],"some":[18,61,64,143,188],"conditions":[19],"which":[20,105],"allow":[21],"it":[22],"to":[23,83,95,184],"be":[24,185,200],"in":[25,31,60,129,202],"polynomial":[26,203],"time.":[27,204],"This":[28],"arises":[30],"functional":[33,54],"compression":[34,55],"where":[36,146],"computation":[38],"function":[41,179],"sources":[43],"is":[44,118,152,213,219],"desired":[45,178],"at":[46],"receiver.":[48],"The":[49],"rate":[50,72],"region":[51,73],"has":[57],"been":[58],"considered":[59],"references":[62],"assumptions.":[65],"Recently,":[66],"Feizi":[67],"et":[68,126],"al.":[69],"computed":[70],"for":[74,176],"general":[76,85],"one-stage":[77],"tree":[78,86],"network":[79],"and":[80,157],"its":[81],"extension":[82],"network.":[87],"their":[89],"proposed":[90],"coding":[91],"scheme,":[92],"one":[93,160],"needs":[94],"compute":[96],"(a":[101],"random":[103],"variable":[104],"minimizes":[106],"entropy)":[108],"graph.":[112],"general,":[114],"an":[119],"NP-hard":[120],"(as":[122],"shown":[123],"by":[124],"Cardinal":[125],"al.).":[127],"However,":[128],"show":[133,165,209],"that":[134,210],"depending":[135],"on":[136,173],"graph's":[139],"structure,":[140],"there":[141],"are":[142],"interesting":[144],"cases":[145],"not":[153],"NP-hard,":[154],"but":[155],"tractable":[156],"practical.":[158],"these":[162],"cases,":[163],"that,":[166],"having":[167],"non-zero":[169],"joint":[170],"probability":[171],"condition":[172],"RVs'":[174],"distributions,":[175],"any":[177],"f,":[180],"makes":[181],"graphs":[183],"formed":[186],"non-overlapping":[189],"fully-connected":[190],"maximal":[191],"independent":[192],"sets.":[193],"Therefore,":[194],"can":[199],"solved":[201],"another":[206],"case,":[207],"if":[211],"f":[212],"quantization":[215],"function,":[216],"also":[220],"tractable.":[221]},"counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}