Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Adjacency matrix

Known as: Adjacency-matrix representation, Sociomatrix, Connectivity matrix 
In graph theory, computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Recent methods for learning vector space representations of words have succeeded in capturing fine-grained semantic and syntactic… Expand
  • figure 1
  • table 2
  • figure 2
  • table 3
  • figure 3
Highly Cited
2011
Highly Cited
2011
Hashing is becoming increasingly popular for efficient nearest neighbor search in massive databases. However, learning short… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2010
Highly Cited
2010
This paper presents a method for detection of steganographic methods that embed in the spatial domain by adding a low-amplitude… Expand
Highly Cited
2010
Highly Cited
2010
This paper presents a method for detection of steganographic methods that embed in the spatial domain by adding a low-amplitude… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • table II
Highly Cited
2010
Highly Cited
2010
Digraphs with doubly stochastic adjacency matrices play an essential role in a variety of cooperative control problems including… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Highly Cited
2010
Highly Cited
2010
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume… Expand
Highly Cited
2009
Highly Cited
2009
We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2004
Highly Cited
2004
In this paper we present a new methodology of class discovery and clustering validation tailored to the task of analyzing gene… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • table II
Highly Cited
2001
Highly Cited
2001
Abstract Eigenvectors of adjacency matrices are useful as measures of centrality or of status. However, they are misapplied to… Expand
  • figure 1
  • table 1
  • table 2
Highly Cited
1988
Highly Cited
1988
  • S. Umeyama
  • IEEE Trans. Pattern Anal. Mach. Intell.
  • 1988
  • Corpus ID: 17437456
An approximate solution to the weighted-graph-matching problem is discussed for both undirected and directed graphs. The weighted… Expand
  • figure 1
  • figure 2
  • figure 4
  • table I
  • table 111