An Upper Bound on Checking Test Complexity for Almost All Cographs Oleg V. Zubkov Department of Computer Science East-Siberian State Academy of Education Irkutsk, Russia Email:

First Page		Document Content
Date: 2013-02-11 10:36:14 FO Binary tree Circuit Path decomposition Tango tree Graph theory Theoretical computer science Cograph		An Upper Bound on Checking Test Complexity for Almost All Cographs Oleg V. Zubkov Department of Computer Science East-Siberian State Academy of Education Irkutsk, Russia Email: Add to Reading List Source URL: www.mpi-sws.org Download Document from Source Website File Size: 132,33 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