Noname manuscript No. (will be inserted by the editor) A portable parallel implementation of the lrs vertex enumeration code David Avis and Gary Roumanis

First Page		Document Content
Date: 2013-11-01 11:17:39 Computer programming Mathematics Software engineering Graph connectivity Connectivity Tree traversal Search algorithms NP-complete problems Biconnected component HopcroftKarp algorithm		Noname manuscript No. (will be inserted by the editor) A portable parallel implementation of the lrs vertex enumeration code David Avis and Gary Roumanis Add to Reading List Source URL: cgm.cs.mcgill.ca Download Document from Source Website File Size: 858,32 KB Share Document on Facebook

	Polishing Structural Bulk Updates in a Native XML Database Master thesis presented by Lukas Kircher DocID: 1rnM2 - View Document
	Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n DocID: 1rjuk - View Document
	´ Scalable Task Pools with CAFE: Adjustable Fairness and Contention Dmitry Basin1 , Rui Fan2 , Idit Keidar1 , Ofer Kiselov1 , and Dmitri Perelman1? 1 DocID: 1r7j1 - View Document
	Noname manuscript No. (will be inserted by the editor) A portable parallel implementation of the lrs vertex enumeration code David Avis and Gary Roumanis DocID: 1qDjI - View Document
	Efficient and Scalable Sequence-Based XML Filtering Mariam Salloum Vassilis J. Tsotras University of California, DocID: 1qC8y - View Document