General paritioning on random graphs

DOI10.1006/JAGM.2001.1197MaRDI QIDQ2777610zbMATH OpenOpenAlexFDO

Authors C. R. Subramanian, C. E. Veni Madhavan

Publication date 11 September 2002

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2001.1197

zbMATH Keywords

general partitioning problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 845673
• Random graphs and the parity quantifier
• Random graphs and the parity quantifier
• On the spectra of general random graphs
• On the degree properties of generalized random graphs
• scientific article; zbMATH DE number 18981
• On a method for random graphs
• scientific article; zbMATH DE number 3943865
• scientific article; zbMATH DE number 3893250
• scientific article; zbMATH DE number 3150484

Cited in

(8)

• The community structure of human cellular signaling network
• The solution of some random NP-hard problems in polynomial expected time
• Finding Planted Partitions in Random Graphs with General Degree Distributions
• Random graphs of Internet type and the generalised allocation scheme
• Graph partitioning via adaptive spectral techniques
• Max Cut for Random Graphs with a Planted Partition
• scientific article; zbMATH DE number 6767551 (Why is no real title available?)
• scientific article; zbMATH DE number 2230218 (Why is no real title available?)

This page was built for publication: General paritioning on random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2777610)