The Vertex Separation Number of a Graph Equals Its Path-Width¶

Kinnersley, N. G. (1992). The Vertex Separation Number of a Graph Equals Its Path-Width. Information Processing Letters, 42(6), 345-350.

Type: Journal article
Intellectual base: Primary research
Year: 1992
DOI: 10.1016/0020-0190(92)90234-m
Link: https://doi.org/10.1016/0020-0190(92)90234-M

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Pathwidth
- Equivalent formulations through vertex separation and node searching translate the same frontier burden into an ordering or search game, subject to their offset and convention choices.

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:75d465b6eb5c · see in the full table