Upper bounds on algebraic connectivity via convex optimization

By Arpita Ghosh, Stephen P. Boyd. 2006

55 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Organic Chemistry

View Paper: https://www.semanticscholar.org/paper/91736f581c91fd3f5755ea09875313456c9abbf2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. N. Abreu
2. Amin Saberi
3. Arpita Ghosh
4. Stephen P. Boyd
5. Brendan O'Donoghue
6. Steven Diamond
7. Stamatios Lefkimmiatis
8. Jaehyun Park

In Geometry and Topology

1. N. Abreu
2. Amin Saberi
3. Arpita Ghosh
4. Stephen P. Boyd

In Organic Chemistry

1. N. Abreu
2. Amin Saberi
3. Arpita Ghosh
4. Stephen P. Boyd

Citations in the corpus

• Minimizing Effective Resistance of a Graph (2008, methodology): “4]; for more in the context of graph optimization problems, see [5, 18].”
• Old and new results on algebraic connectivity of graphs (2007, methodology): “Also, Ghosh and Boyd [29] describe a method to maximize the second smallest eigenvalue over the convex hull of the Laplacian of graphs in a particular family which is a convex optimization problem.”