Sciweavers

654 search results - page 34 / 131
» Matrix Graph Grammars
Sort
View
JCT
2008
85views more  JCT 2008»
13 years 8 months ago
Smith normal form and Laplacians
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
Dino J. Lorenzini
NETWORKS
2006
13 years 8 months ago
A simple algorithm that proves half-integrality of bidirected network programming
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
Ethan D. Bolker, Thomas Zaslavsky
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
14 years 15 days ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
CORR
2012
Springer
195views Education» more  CORR 2012»
12 years 4 months ago
Ranking hubs and authorities using matrix functions
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
Michele Benzi, Ernesto Estrada, Christine Klymko
ICDM
2009
IEEE
202views Data Mining» more  ICDM 2009»
13 years 6 months ago
Link Prediction on Evolving Data Using Matrix and Tensor Factorizations
Abstract--The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In t...
Evrim Acar, Daniel M. Dunlavy, Tamara G. Kolda