← All Problems
Open

Canonical Labeling Well-founded Extensional Relation (CLWER)

Category: Searching Graphs

Input

A well-founded relation $(V, E)$.

Problem

Compute a canonical labeling of the relation.

Definitions

See [1].

Status

Open (Dahlhaus [1]).

Remarks

See MostEpi for a related $\P$-complete problem.

References

  1. E. Dahlhaus (1987). Is SETL a suitable language for parallel programming — a theoretical approach.
  2. Greenlaw, R., Hoover, H. J., and Ruzzo, W. L. (1995). Limits to Parallel Computation: P-Completeness Theory. Oxford University Press. Problem B.3.1.

Related Problems