Paper

You must be logged in to use all features
Import a .START file
Add this to a Review
Tell someone about this
Search on Google Scholar
Download Bibtex
Download APA reference
Edit this data
Manage associations
Merge it with duplicates
Exec internal actor
Update from DOI
Add multiple references

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

2004

Created by ACM worker at 2019-04-10 11:09:06.0.

Simplified Graph of Associations

SHOW IT!!! (may be slow...)
How to use it
Use default pruning algorithm
Use alternative pruning algorithm
Generate image with complete graph
Show Graph Info
Download graph data for viewer
Get URL to embbed it anywhere

Word Cloud

Get URL to embbed it anywhere
Search topics on Google Scholar

Research Paradigm

Add/Edit Research Paradigms

Authors

View detailed list
Add an Author
Get URL to embbed this list anywhere

Daniel A. Spielman

Shang-Hua Teng

Venue

View detailed list
Add a Venue
Get URL to embbed this list anywhere

Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC ’04

Referenced By

View detailed list
Add a Citer
Get URL to embbed this list anywhere

Uncovering the Small Community Structure in Large Networks

Help

Your opinion

Is it representative of "Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems"?

It does not represent at all.

Poorly representative, misses some key aspects.

Representative, but misses secondary aspects.

Representative, capaturing important aspects.

Very representative.

Does it provide additional information for your research?

Totally disagree.

Partially disagree.

Neutral.

Partially agree.

Totally agree.

How does this feature contributes to your overall usage of this system?

I use the system despite of this feature

Sometimes it is annoying

Neutral

Sometimes it is useful

I use the system because of this feature

Please provide any other comment or suggestion:

Your email (optional):

Let other people know about this data

Paper :

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

Send a link to this page to:

Send to yourself
Aditional email(s):
Custom message:

Add to a Bibliographic Set

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

Reviews owned by user

Why help?

If you for we can improve the data describing it. In turn, this can help you and other users to improve bibliographical sets and reviews, based on new data we retrieve after your contribution.

Graph Info

Information

Run Internal Actor

Scientific Paradigms

Select one or more research facets assignable to this publication:

Positivism

Post-Positivism

Critical-Ideological

Constructivism-Interpretativism

Other:

Add association

First, try and find an existing:
Name