Alan Arroyo

Learn More
The Path Partition Conjecture for digraphs states that for every digraph D, and every choice of positive integers λ 1 , λ 2 such that λ 1 + λ 2 equals the order of a longest directed path in D, there exists a partition of D in two subdigraphs D 1 , D 2 such that the order of the longest path in D i is at most λ i for i = 1, 2. We present sufficient(More)
v Foreword Water Plan Update 2009 epitomizes collaboration. It reflects the perspectives of many and varied individuals, groups, and government entities representing the full spectrum of issues, concerns, and visions for the future of water management in California. Update 2009 has been enhanced by the leadership of 21 State agencies and departments that(More)
  • 1