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)

Related topics

Related topics

50 relations
Adjacency listB-coloringBipartite realization problemBridge (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Model T: an empirical model for user registration patterns in a campus wireless LAN
We derive an empirical model for spatial registration patterns of mobile users as they move within a campus wireless local area… 
Highly Cited
1994
Highly Cited
1994
Finding the k Quickset Simple Paths in a Network
Highly Cited
1994
Highly Cited
1994
Performance of iterative computation in self-timed rings
  • T. Williams
  • J. VLSI Signal Process.
  • 1994
  • Corpus ID: 5229136
The computation of iterative functions need not be limited by the rate at which external signals, such as a clock, can be… 
Highly Cited
1992
Highly Cited
1992
An interactive layout heuristic based on hexagonal adjacency graphs
Highly Cited
1983
Highly Cited
1983
Minimum-Via Topological Routing
  • Chi-Ping Hsu
  • IEEE Trans. Comput. Aided Des. Integr. Circuits…
  • 1983
  • Corpus ID: 17126741
A new approach to the two-dimensional routing utilizing two layers is proposed. It consists of two major steps, topological… 
Highly Cited
1983
Highly Cited
1983
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
In this paper we describe two interconnection networks for parallel processing, namely the orthogonal trees network and the… 
Highly Cited
1981
Highly Cited
1981
Node-fault diagnosis and a design of testability
A concept of k-node-fault testability is introduced. A sufficient and almost necessary condition for testability as well as the… 
Highly Cited
1980
Highly Cited
1980
Generalization of the Graph Center Concept, and Derived Topological Centric Indexes
6 z The concept of topological center is generalized for any connected acyclic or cyclic graph on the basis of the topological… 
Review
1976
Review
1976
Analytical precision of one-sixth order semiquantitative spectrographic analysis
Over 2,700 separate analyses were made on 22 different geologic samples selected to cover wide concentration ranges for the 30… 
Highly Cited
1971
Highly Cited
1971
Pair Grammars, Graph Languages and String-to-Graph Translations
  • T. W. Pratt
  • Journal of computer and system sciences (Print)
  • 1971
  • Corpus ID: 205894879
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)