Undirected Graph

A graph in which the edges are not ordered, and therefore, are symmetric.
National Institutes of Health

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
High-dimensional regression/classification continues to be an important and challenging problem, especially when features are… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We present a general framework for constructing cut sparsifiers in undirected graphs --- weighted subgraphs for which every cut… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Let F be a probability distribution with support on the non-negative integers. Four methods for generating a simple undirected… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper describes a Goal Centric approach for effectively maintaining critical system qualities such as security, performance… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Fast and accurate side-chain conformation prediction is important for homology modeling, ab initio protein structure prediction… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper, we provide tools for convergence and performance analysis of an agreement protocol for a network of integrator… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertex set… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1973
Highly Cited
1973
Description bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other complete… (More)
  • figure 2
  • figure 2
Is this relevant?
Highly Cited
1973