Back to Results
First PageMeta Content
Graph coloring / Computational problems / Combinatorial optimization / Matching / Graph minor / Gap reduction / Shortest path problem / Sharp-P-completeness of 01-permanent


The Complexity of Rationalizing Network Formation Shankar Kalyanaraman Computer Science Department California Institute of Technology Pasadena, CAEmail:
Add to Reading List

Document Date: 2009-08-11 16:34:41


Open Document

File Size: 219,08 KB

Share Result on Facebook