2005 International Conference on Analysis of Algorithms

Daniel Berend, E. K., & Zucker, S. (2005). 2005 International Conference on Analysis of Algorithms.

Type

Unclassified

Intellectual base

Unclassified

Year

2005

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Strong product of graphs
  • … three adjacency cases, simple or directed variant, identity terms, commutativity and associativity up to isomorphism, distance formula, connectedness, and factorization claims 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:8f5136ebff5d · see in the full table