Proceedings of the 5^th International Conference on Algorithms and Complexity

Miroslav Chlebík, J. C. (2003). Proceedings of the 5th International Conference on Algorithms and Complexity.

Type

Unclassified

Intellectual base

Unclassified

Year

2003

DOI

10.1007/3-540-44849-7_21

Link

https://doi.org/10.1007/3-540-44849-7_21

Cited by

1 citation across 1 artifact.

Domain-specific

• Independent set (graph theory)
  • … vertex subset, pairwise nonadjacency condition, complement-clique equivalence, cardinality or weight, maximal versus maximum status, independence number and computational complexity are explicit. to An applied instance preserves the invariant under changed notation, scale, dataset, jurisdiction, 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:b048dfd0ffbc · see in the full table