The following pages link to Jason G. DeVinney (Q1612929):
Displayed 6 items.
- On the distribution of the domination number for random class cover catch digraphs (Q158221) (← links)
- Item:Q1612929 (redirect page) (← links)
- Classification using class cover catch digraphs (Q1762812) (← links)
- A SLLN for a one-dimensional class cover problem (Q1871304) (← links)
- A new family of proximity graphs: class cover catch digraphs (Q2506361) (← links)
- An efficient network flow code for finding all minimum cost \(s-t\) cutsets (Q5952784) (← links)