Computing the chromatic index of Steiner Triple systems

Charles J. Colbourn

doi:10.1093/comjnl/25.3.338

Computing the chromatic index of Steiner Triple systems

Charles J. Colbourn

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

6 Scopus citations

Abstract

A branch-and-bound algorithm for finding an optimal colouring of the blocks of a Steiner triple system is developed. Two simple but powerful heuristics are devised which improve the method. Applications to scheduling and the design of experiments are outlined.

Original language	English (US)
Pages (from-to)	338-339
Number of pages	2
Journal	Computer Journal
Volume	25
Issue number	3
DOIs	https://doi.org/10.1093/comjnl/25.3.338
State	Published - Aug 1982
Externally published	Yes

ASJC Scopus subject areas

General Computer Science

Access to Document

10.1093/comjnl/25.3.338

Cite this

@article{c6957e92b3cc4a5f9d438d28f6d00257,

title = "Computing the chromatic index of Steiner Triple systems",

abstract = "A branch-and-bound algorithm for finding an optimal colouring of the blocks of a Steiner triple system is developed. Two simple but powerful heuristics are devised which improve the method. Applications to scheduling and the design of experiments are outlined.",

author = "Colbourn, {Charles J.}",

year = "1982",

month = aug,

doi = "10.1093/comjnl/25.3.338",

language = "English (US)",

volume = "25",

pages = "338--339",

journal = "Computer Journal",

issn = "0010-4620",

publisher = "Oxford University Press",

number = "3",

}

TY - JOUR

T1 - Computing the chromatic index of Steiner Triple systems

AU - Colbourn, Charles J.

PY - 1982/8

Y1 - 1982/8

N2 - A branch-and-bound algorithm for finding an optimal colouring of the blocks of a Steiner triple system is developed. Two simple but powerful heuristics are devised which improve the method. Applications to scheduling and the design of experiments are outlined.

AB - A branch-and-bound algorithm for finding an optimal colouring of the blocks of a Steiner triple system is developed. Two simple but powerful heuristics are devised which improve the method. Applications to scheduling and the design of experiments are outlined.

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

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

U2 - 10.1093/comjnl/25.3.338

DO - 10.1093/comjnl/25.3.338

M3 - Article

AN - SCOPUS:0020165373

SN - 0010-4620

VL - 25

SP - 338

EP - 339

JO - Computer Journal

JF - Computer Journal

IS - 3

ER -

Computing the chromatic index of Steiner Triple systems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this