O-joung Kwon (권오정), Classes of intersection digraphs with good algorithmic properties
An intersection digraph is a digraph where every vertex $v$ is represented by an ordered pair $(S_v, T_v)$ of sets such that there is an edge from $v$ to $w$ …
1 event found.