Simpler Linear-Time Modular Decomposition via Recursive Factorizing Permutations Marc Tedder1 , Derek Corneil1⋆ , Michel Habib2 , and Christophe Paul3⋆⋆ 1 Department of Computer Science, University of Toronto

First Page		Document Content
Date: 2008-04-30 14:20:20 Cograph Neighbourhood Tree Disjoint-set data structure Breadth-first search Path decomposition Tree decomposition Graph theory Graph operations Modular decomposition		Simpler Linear-Time Modular Decomposition via Recursive Factorizing Permutations Marc Tedder1 , Derek Corneil1⋆ , Michel Habib2 , and Christophe Paul3⋆⋆ 1 Department of Computer Science, University of Toronto Add to Reading List Source URL: www.cs.utoronto.ca Download Document from Source Website File Size: 151,79 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