2014•AutomaticaRequires access

Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds

Rosario Aragüés, Guodong Shi, Dimos V. Dimarogonas, Carlos Sagüés, Karl Henrik Johansson, Youcef Mezouar

Open publisher page 70 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 70 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Algebraic connectivity, Algebraic graph theory, Laplacian matrix, Algebraic number, Adjacency matrix, Upper and lower bounds, Mathematics, Convergence (economics)

Back to paper search Browse research topics Original source

Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds — Research Paper | ScholarLens