A linear time algorithm for edge coloring of binomial trees

No abstract is available for this paper.

• Publication year

  1996

• Venue

  Discrete Mathematics

• Publication date

  1996-04-06

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/0012-365X(95)00191-X
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Interval edge-coloring of caterpillars with hairs of arbitrary length

  1987cited by this paper
• An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems

  1985cited by this paper
• Scheduling File Transfers

  1985cited by this paper
• Scheduling file transfers in a distributed network

  1983cited by this paper
• The NP-Completeness of Edge-Coloring

  1981cited by this paper
• Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs

  1979cited by this paper

• Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time

  2001cites this paper
• Chromatic scheduling of dedicated 2-processor UET tasks to minimize mean flow time

  1999cites this paper
• Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors

  1996cites this paper