Degeneracy (graph theory)

Known as: K-core, Degeneracy, Szekeres–Wilf number 
In graph theory, a k-degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
We introduce a method for the theoretical analysis of exponential random graph models. The method is based on a large-deviations… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We study the structure of the social graph of active Facebook users, the largest social network ever analyzed. We compute… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We modify an algorithm of Bron and Kerbosch [1973] for maximal clique enumeration to choose more carefully the order in which the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2011
2011
Community detection and evaluation is an important task in graph mining. In many cases, a community is defined as a subgraph… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Recent advances in statistical network analysis based on the family of exponential random graph (ERG) models have greatly… (More)
  • table 2
  • table 3
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper presents a novel framework for the recognition of objects based on their silhouettes. The main idea is to measure the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper presents recent advances in the statistical modeling of random graphs that have an impact on the empirical study of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Software systems emerge from mere keystrokes to form intricate functional networks connecting many collaborating modules, objects… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A large number of 3D models are created and available on the Web, since more and more 3D modelling and digitizing tools are… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The Bekenstein-Hawking area-entropy relation SBH = A/4 is derived for a class of five-dimensional extremal black holes in string… (More)
Is this relevant?