Searching for "Reachability relations in digraphs." – sorted by Relevance.
-
Crown-free highly arc-transitive digraphs
- not have universal reachability relation and which omit special digraphs called ‘crowns’. Moreover
- Add To MetaCart
-
Novel framework for using causal models in distributed fault diagnosis
- on the reachability relation on the digraph vertex set. The reachability relation R is defined as follows. Given two
- Cited by 1 (1 self) – Add To MetaCart

