Date: 2010-08-23 12:08:01

NP-complete problems

Spanning tree

Line graph

Time complexity

Planar graph

Graph partition

Minor

Trapezoid graph

Eulerian path

Graph theory

Theoretical computer science

Mathematics

Approaching Optimality For Solving SDD Linear Systems Ioannis Koutis Carnegie Mellon University Email: [removed] Gary L. Miller

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 207,23 KB