Channel assignment on graphs of bounded treewidth
Authors:
- Colin McDiarmidCMColin McDiarmid
- Bruce ReedBRBruce Reed
- 6 December 2003
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 273 (1-3) , 183-192
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Tree Width and Tangles: A New Connectivity Measure and Some Applications1997
- Coloring precolored perfect graphsJournal of Graph Theory, 1997
- A linear time algorithm for finding tree-decompositions of small treewidth1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980