Graph Partitioning via Adaptive Spectral Techniques (Q3557535)

From MaRDI portal

Revision as of 17:52, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Graph Partitioning via Adaptive Spectral Techniques	scientific article

Statements

scholarly article

0 references

Graph Partitioning via Adaptive Spectral Techniques (English)

0 references

Amin Coja-Oghlan

0 references

Combinatorics, Probability and Computing

0 references

publication date

23 April 2010

0 references

MaRDI profile type

MaRDI publication profile

0 references

Partitioning Sparse Matrices with Eigenvectors of Graphs

0 references

General Partitioning on Random Graphs

0 references

The Largest Eigenvalue of Sparse Random Graphs

0 references

0 references

Sparse quasi-random graphs

0 references

The Metropolis algorithm for graph bisection

0 references

Quick approximation to matrices and applications

0 references

The eigenvalues of random symmetric matrices

0 references

Max Cut for Random Graphs with a Planted Partition

0 references

Spectral techniques applied to sparse random graphs

0 references

Heuristics for semirandom graph problems

0 references

The solution of some random NP-hard problems in polynomial expected time

0 references

0 references

A Spectral Technique for Coloring Random 3-Colorable Graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1017/S0963548309990514

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3557535

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3557535&oldid=35166640"