Edge Coloring a K-Tree into Two Smaller Trees

Dilip Chhajed

doi:10.1002/(SICI)1097-0037(199707)29:4<191::AID-NET1>3.0.CO;2-A

Edge Coloring a K-Tree into Two Smaller Trees

Dilip Chhajed

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1002/(SICI)1097-0037(199707)29:4<191::AID-NET1>3.0.CO;2-A
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

Access to Document

10.1002/(SICI)1097-0037(199707)29:4<191::AID-NET1>3.0.CO;2-A

Fingerprint Dive into the research topics of 'Edge Coloring a K-Tree into Two Smaller Trees'. Together they form a unique fingerprint.

Cite this

@article{d3f3c104a6b64a59beaa00d0763fc601,

title = "Edge Coloring a K-Tree into Two Smaller Trees",

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.",

keywords = "Analysis of algorithms, Facilities planning, Location, Networks/graphs, Suboptimal algorithms, Theory",

author = "Dilip Chhajed",

year = "1997",

month = jul,

doi = "10.1002/(SICI)1097-0037(199707)29:4<191::AID-NET1>3.0.CO;2-A",

language = "English (US)",

volume = "29",

pages = "191--194",

journal = "Networks",

issn = "0028-3045",

publisher = "Wiley-Liss Inc.",

number = "4",

}

TY - JOUR

T1 - Edge Coloring a K-Tree into Two Smaller Trees

AU - Chhajed, Dilip

PY - 1997/7

Y1 - 1997/7

N2 - 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.

AB - 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.

KW - Analysis of algorithms

KW - Facilities planning

KW - Location

KW - Networks/graphs

KW - Suboptimal algorithms

KW - Theory

UR - http://www.scopus.com/inward/record.url?scp=0347140010&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347140010&partnerID=8YFLogxK

U2 - 10.1002/(SICI)1097-0037(199707)29:4<191::AID-NET1>3.0.CO;2-A

DO - 10.1002/(SICI)1097-0037(199707)29:4<191::AID-NET1>3.0.CO;2-A

M3 - Article

AN - SCOPUS:0347140010

VL - 29

SP - 191

EP - 194

JO - Networks

JF - Networks

SN - 0028-3045

IS - 4

ER -

Edge Coloring a K-Tree into Two Smaller Trees

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this