Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Cases where finding the minimum entropy coloring of a characteristic graph ..."

Soheil Feizi, Muriel Médard (2010)

> Home

Details and statistics

DOI: 10.1109/ISIT.2010.5513270

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isit/FeiziM10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/FeiziM10
Soheil Feizi, Muriel Médard:
Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem. ISIT 2010: 116-120

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.