# Nearly-Linear Time Algorithms for Graph Partitioning

Credited to: Daniel Spielman & Shang-Hua Teng

Canonical: https://www.synapsebooks.app/catalog/nearly-linear-time-algorithms-for-graph-partitioning

Status: Discovery record. No guide is published.

## Focus

Supplied bibliography entry.

## The Library, Volume V

Listed title: Nearly-Linear Time Algorithms for Graph Partitioning

Listed credit: Daniel Spielman & Shang-Hua Teng

Publication details: Not supplied

Source shelf: V. Numerical Linear Algebra and Monte Carlo

Source line: 2337

Group: None

Difficulty: 3

No supplied note

Catalog metadata from the supplied bibliography. Edition and access verification pending.

## Find the original

Edition verification pending. [Search Open Library](https://openlibrary.org/search?title=Nearly-Linear+Time+Algorithms+for+Graph+Partitioning&author=Daniel+Spielman+%26+Shang-Hua+Teng)

This discovery record is not a book summary. Named editorial approval of guide text remains pending.
