Graph Imperfection II.
The imperfection ratio is a graph invariant which indicates how good a lower bound the weighted clique number gives on the weighted chromatic number, in the limit as weights get large. Its introduction was motivated by investigations of the radio channel assignment problem, where one has to assign c...
Main Authors: | Gerke, S, McDiarmid, C |
---|---|
Formato: | Journal article |
Idioma: | English |
Publicado em: |
Elsevier
2001
|
Registos relacionados
-
Graph Imperfection.
Por: Gerke, S, et al.
Publicado em: (2001) -
Graph Imperfection with a Co-Site Constraint.
Por: Gerke, S, et al.
Publicado em: (2004) -
On the Number of Edges in Random Planar Graphs.
Por: Gerke, S, et al.
Publicado em: (2004) -
Random planar graphs with n nodes and a fixed number of edges.
Por: Gerke, S, et al.
Publicado em: (2005) -
Random graphs on surfaces.
Por: McDiarmid, C
Publicado em: (2008)