Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2016

Highly Cited

2016

In this chapter, we draw motivation from real-world networks, and formulate random graph models for them. We focus on some of the… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

We consider a random graph process in which vertices are
added to the graph one at a time and joined to a fixed number
m of… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

This text is an in-depth account of graph theory. It reflects the current state of the subject and emphasizes connections with… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

Let E,, .V denote the set of all graphs having n given labelled vertices VI, L’s;,., Vn and N edges. The graphs considered are… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

Recently, Barabasi and Albert [2] suggested modeling complex real-world networks such as the worldwide web as follows: consider a… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

Given a sequence of nonnegative real numbers λ0, λ1, … that sum to 1, we consider a random graph having approximately λin… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

Given a sequence of nonnegative real numbers λ0, λ1… which sum to 1, we consider random graphs having approximately λi n vertices… Expand

Is this relevant?

Highly Cited

1984

Highly Cited

1984

(n) k edges have equal probabilities to be chosen as the next one . We shall 2 study the "evolution" of such a random graph if N… Expand

Is this relevant?