A district is a maximal set of vertices connected by a path consisting entirely of bidirected edges.
A vertex is fixable when its district contains no proper directed descendant of that vertex. Equivalently, .

Ancestors (7)

  1. Acyclic directed mixed graph
  2. Causal directed acyclic graph
  3. Causal inference
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version