An improved approximation for Maximum k-dependent Set on bipartite graphs

Seyedmohammadhossein Hosseinian, S. B. (2021). An improved approximation for Maximum k-dependent Set on bipartite graphs.

Type

Unclassified

Intellectual base

Unclassified

Year

2021

DOI

10.1016/j.dam.2021.10.015

Link

https://doi.org/10.1016/j.dam.2021.10.015

Cited by

1 citation across 1 artifact.

Domain-specific

• Dissociation number
  • … that the graph type and finiteness, induced-subgraph convention, degree bound one, cardinality objective, weighting if any, and exact, parameterized, or approximation criterion are explicit. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..

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:05a65b53741a · see in the full table