<--- Back to Details
First PageDocument Content
NP-complete problems / Graph / Directed graph / Strongly connected component / Strong orientation / Graph coloring / Path decomposition / Graph theory / Mathematics / Graph connectivity
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

Similar Documents