Abstract
The problem of the edge coloring partial k-tree into two partial p- and q-trees with p, q < k is considered. An algorithm is provided to construct such a coloring with p + q = k. Usefulness of this result in a Lagrangian decomposition framework to solve certain combinatorial optimization problems is discussed.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 191-194 |
| Number of pages | 4 |
| Journal | Networks |
| Volume | 29 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jul 1997 |
Keywords
- Analysis of algorithms
- Facilities planning
- Location
- Networks/graphs
- Suboptimal algorithms
- Theory
ASJC Scopus subject areas
- Software
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications