Approximation Algorithms for Orienting Mixed Graphs

First Page		Document Content
Date: 2011-09-25 15:14:20 NP-complete problems Graph Directed graph Strongly connected component Strong orientation Graph coloring Path decomposition Graph theory Mathematics Graph connectivity		Approximation Algorithms for Orienting Mixed Graphs Add to Reading List Source URL: www.cs.ucr.edu Download Document from Source Website File Size: 403,83 KB Share Document on Facebook

	Conflict-Directed Graph Coverage Daniel Schwartz-Narbonne1 , Martin Sch¨af2 , Dejan Jovanovi´c2 , Philipp R¨ ummer3 , and Thomas Wies1 1 DocID: 1xVY3 - View Document
	Lower and Upper bounds for Online Directed Graph Exploration Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch DocID: 1vj8s - View Document
	Conflict-Directed Graph Coverage Daniel Schwartz-Narbonne1 , Martin Sch¨af2 , Dejan Jovanovi´c2 , Philipp R¨ ummer3 , and Thomas Wies1 1 DocID: 1sVcM - View Document
	Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1 DocID: 1rmNc - View Document
	Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains Isabelle Stanton∗ Ali Pinar† UC Berkeley Sandia National Laboratories‡ DocID: 1rdvb - View Document