Rodolfo Carvajal

Learn More
Connectivity requirements are a common component of forest planning models, with important examples arising in wildlife habitat protection. In harvest scheduling models, one way of addressing preservation concerns consists of requiring that large contiguous patches of mature forest are maintained. In the context of nature reserve design, it is common(More)
Let G = (V, E) be a graph. A nonempty subset S ⊆ V is a (strong defensive) alliance of G if every node in S has at least as many neighbors in S than in V \ S. This work is motivated by the following observation: when G is a locally structured graph its nodes typically belong to small alliances. Despite the fact that finding the smallest alliance in a graph(More)
  • 1