Node-Deletion Problems on Bipartite Graphs

Yannakakis, M. (1981). Node-Deletion Problems on Bipartite Graphs.

Type

Unclassified

Intellectual base

Unclassified

Year

1981

DOI

10.1137/0210022

Link

https://doi.org/10.1137/0210022

Cited by

1 citation across 1 artifact.

Domain-specific

• Dissociation number
  • A dissociation set can contain isolated vertices and disjoint edges but no induced path of length two or higher-degree vertex; maximizing its cardinality is NP-hard in broad graph classes.

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:5478e646c4d4 · see in the full table