Skip to search formSkip to main contentSkip to account menu

Graph (discrete mathematics)

Known as: Simple graph, Finite undirected graph, Undirected 
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Restricted Boltzmann machines were developed using binary stochastic hidden units. These can be generalized by replacing each… 
Highly Cited
2009
Highly Cited
2009
Highly Cited
2009
Highly Cited
2009
Gephi is an open source software for graph and network analysis. It uses a 3D render engine to display large networks in real… 
Highly Cited
2004
Highly Cited
2004
In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three… 
Highly Cited
2003
Highly Cited
2003
  • J. Gross
  • Discrete Mathematics and Its Applications
  • 2003
  • Corpus ID: 34005336
Introduction to Graphs Fundamentals of Graph Theory, Jonathan L. Gross and Jay Yellen Families of Graphs and Digraphs, Lowell W… 
Review
1991
Review
1991
  • L. VincentP. Soille
  • IEEE Transactions on Pattern Analysis and Machine…
  • 1991
  • Corpus ID: 15436061
A fast and flexible algorithm for computing watersheds in digital gray-scale images is introduced. A review of watersheds and… 
Highly Cited
1986
Highly Cited
1986
  • R. Bryant
  • IEEE transactions on computers
  • 1986
  • Corpus ID: 10385726
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms… 
Highly Cited
1974
Highly Cited
1974
From the Publisher: With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of… 
Highly Cited
1964
Highly Cited
1964
A handbook of mathematical functions that is designed to provide scientific investigations with a comprehensive and self… 
Highly Cited
1959
Highly Cited
1959
  • E. Dijkstra
  • Numerische Mathematik
  • 1959
  • Corpus ID: 123284777
We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We…