Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs
- 30 November 2001
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 10, 198-201
- https://doi.org/10.1016/s1571-0653(04)00393-2
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980