Local Search: Is Brute-Force Avoidable?

First Page		Document Content
Date: 2009-06-22 08:17:00 Planar graphs NP-complete problems Tree decomposition Minor Apex graph Graph Clique-sum Neighbourhood Vertex cover Graph theory Theoretical computer science Graph operations		Local Search: Is Brute-Force Avoidable? Add to Reading List Source URL: ijcai.org Download Document from Source Website File Size: 494,64 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