Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
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… 
Highly Cited
2010
Highly Cited
2010
Digraphs with doubly stochastic adjacency matrices play an essential role in a variety of cooperative control problems including… 
Highly Cited
2010
Highly Cited
2010
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume… 
Highly Cited
2009
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… 
Highly Cited
2001
Review
1994
Review
1994
Highly Cited
1989
Highly Cited
1989
  • G. Cybenko
  • J. Parallel Distributed Comput.
  • 1989
  • Corpus ID: 1680222
Highly Cited
1967
Highly Cited
1967
  • W. Wonham
  • IEEE Transactions on Automatic Control
  • 1967
  • Corpus ID: 18725472
It is shown that controllability of an open-loop system is equivalent to the possibility of assigning an arbitrary set of poles…