67 citations
- University of Illinois Urbana-ChampaignUS2 papers
- Hebrew University of JerusalemIL1 paper
- Karlstad UniversitySE1 paper
- Luleå University of TechnologySE1 paper
- Royal Holloway University of LondonGB1 paper
- Universidad de LondresMX1 paper
- Universitat de BarcelonaES1 paper
- University of California San DiegoUS1 paper
- University of Southern CaliforniaUS1 paper
- U.S. National Science FoundationUS1 paper
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 of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by 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 of vertices of an acyclic digraph is convex if and there is no directed path between vertices of which contains a vertex not in . A set i…