The complexity of path coloring and call scheduling

Thomas Erlebach, K. J. (2001). The complexity of path coloring and call scheduling.

Type

Unclassified

Intellectual base

Unclassified

Year

2001

DOI

10.1016/s0304-3975(99)00152-8

Link

https://doi.org/10.1016/s0304-3975(99)00152-8

Cited by

1 citation across 1 artifact.

Domain-specific

• Path coloring
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:3fcb521422f6 · see in the full table