P. Balister

most citedContinuum percolation with steps in an annulus

18 citations · 18 across the 4 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2007

Convex sets in acyclic digraphs

P. Balister, S. Gerke, G. Gutin

A non-empty set $X$ of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by $X$ is connected and it is called convex if no two vertices…

cs.DM2007

Algorithms for Generating Convex Sets in Acyclic Digraphs

P. Balister, S. Gerke, G. Gutin +5

A set $X$ of vertices of an acyclic digraph $D$ is convex if $X \neq = \emptyset$ and there is no directed path between vertices of $X$ which contains a vertex not in $X$ . A set $X$ i…