In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice. The degree… (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2011

Highly Cited

2011

- Magnús M. Halldórssonz, Jaikumar Radhakrishnanx
- 2011

The minimum-degree greedy algorithm, or Greedy for short, is a simple and well studied method for nding independent sets in… (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Joseph K. Blitzstein, Persi Diaconis
- Internet Mathematics
- 2011

Random graphs with a given degree sequence are a useful model capturing several features absent in the classical Erdős-Rényi… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Kun Liu, Evimaria Terzi
- SIGMOD Conference
- 2008

The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

Contents Preface vii Chapter 1. Graph Theory in the Information Age 1 1.1. Introduction 1 1.2. Basic definitions 3 1.3. Degree… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Lun Li, David L. Alderson, John Doyle, Walter Willinger
- Internet Mathematics
- 2005

There is a large, popular, and growing literature on “scale-free networks” with the Internet along with metabolic networks… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Fabien Viger, Matthieu Latapy
- COCOON
- 2005

We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Béla Bollobás, Oliver Riordan, Joel H. Spencer, Gábor E. Tusnády
- Random Struct. Algorithms
- 2001

Recently, Barabási and Albert [2] suggested modeling complex real-world networks such as the worldwide web as follows: consider a… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Michael Molloy, Bruce A. Reed
- Random Struct. Algorithms
- 1995

Given a sequence of non-negative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Ulrich Fößmeier, Michael Kaufmann
- Graph Drawing
- 1995

We consider the problem of drawing plane graphs with an arbitrarily high vertex degree orthogonally into the plane such that the… (More)

Is this relevant?