COMPUTING THE CHROMATIC INDEX OF STEINER TRIPLE SYSTEMS.

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

A branch-and-bound algorithm for finding an optimal coloring 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 languageEnglish (US)
Pages (from-to)338-339
Number of pages2
JournalComputer Journal
Volume25
Issue number3
StatePublished - Aug 1982
Externally publishedYes

Fingerprint

Chromatic Index
Steiner Triple System
Design of Experiments
Branch and Bound Algorithm
Coloring
heuristics
Design of experiments
scheduling
Colouring
Color
Scheduling
Heuristics
Computing
experiment
index
method

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Information Systems
  • Software
  • Molecular Biology
  • Statistics and Probability
  • Computational Mathematics
  • Development
  • Management, Monitoring, Policy and Law
  • Demography
  • Computer Science(all)

Cite this

COMPUTING THE CHROMATIC INDEX OF STEINER TRIPLE SYSTEMS. / Colbourn, Charles.

In: Computer Journal, Vol. 25, No. 3, 08.1982, p. 338-339.

Research output: Contribution to journalArticle

@article{c6957e92b3cc4a5f9d438d28f6d00257,
title = "COMPUTING THE CHROMATIC INDEX OF STEINER TRIPLE SYSTEMS.",
abstract = "A branch-and-bound algorithm for finding an optimal coloring 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 = "Charles Colbourn",
year = "1982",
month = "8",
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

PY - 1982/8

Y1 - 1982/8

N2 - A branch-and-bound algorithm for finding an optimal coloring 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 coloring 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

M3 - Article

AN - SCOPUS:0020165373

VL - 25

SP - 338

EP - 339

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 3

ER -