Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques

Haim Kaplan, R. S. (1996). Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques.

Type

Unclassified

Intellectual base

Unclassified

Year

1996

DOI

10.1137/s0097539793258143

Link

https://doi.org/10.1137/s0097539793258143

Cited by

1 citation across 1 artifact.

Domain-specific

• Graph bandwidth
  • 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:1962cbaab36f · see in the full table