On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

First Page		Document Content
Date: 2011-07-18 11:44:43 Combinatorial optimization Graph theory NP-complete problems Network theory Edsger W. Dijkstra Steiner tree problem Simplex Matching Bipartite graph Graph Shortest path problem A* search algorithm		On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich Add to Reading List Source URL: www.cs.rpi.edu Download Document from Source Website File Size: 228,75 KB Share Document on Facebook

	Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook DocID: 1xVkB - View Document
	PDF Document DocID: 1xkJU - View Document
	Graph theory Po-Shen Loh June DocID: 1vmTo - View Document
	Graph theory Po-Shen Loh June DocID: 1vhpu - View Document
	Graph theory Po-Shen Loh June DocID: 1v8nl - View Document