(untitled)

Berwanger, D., Erich Grädel, E. —. A. M. f. t. C. o. D. G. w. A. t. L., & Games, L. 2. (2005). (untitled).

Type

Unclassified

Intellectual base

Unclassified

Year

2005

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Entanglement (graph measure)
  • … observable transfers from An acyclic directed graph has entanglement zero, whereas a simple directed cycle requires one cop under the standard rules. to An algorithmic proof establishes bounded entanglement with a strategy or decomposition before invoking tractability results for parity games or modal logic..

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:2e1254f75a00 · see in the full table