Sciweavers

43 search results - page 1 / 9
» Kron Reduction of Graphs with Applications to Electrical Net...
Sort
View
CORR
2011
Springer
198views Education» more  CORR 2011»
12 years 10 months ago
Kron Reduction of Graphs with Applications to Electrical Networks
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
Florian Dörfler, Francesco Bullo
CDC
2010
IEEE
172views Control Systems» more  CDC 2010»
12 years 7 months ago
Electrical centrality measures for electric power grid vulnerability analysis
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
Zhifang Wang, Anna Scaglione, Robert J. Thomas
SDM
2010
SIAM
213views Data Mining» more  SDM 2010»
13 years 5 months ago
Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
Jérôme Kunegis, Stephan Schmidt, Andr...
ECML
2005
Springer
13 years 9 months ago
Nonrigid Embeddings for Dimensionality Reduction
Spectral methods for embedding graphs and immersing data manifolds in low-dimensional speaces are notoriously unstable due to insufficient and/or numberically ill-conditioned con...
Matthew Brand
JCO
2010
101views more  JCO 2010»
13 years 2 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier