Sciweavers

37 search results - page 2 / 8
» On the Degree Sequences of Random Outerplanar and Series-Par...
Sort
View
JGAA
2007
142views more  JGAA 2007»
14 years 9 months ago
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
Kerri Morgan, Graham Farr
67
Voted
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
15 years 6 months ago
The scaling window for a random graph with a given degree sequence
Hamed Hatami, Michael Molloy
CPC
1998
123views more  CPC 1998»
14 years 9 months ago
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
Michael Molloy, Bruce A. Reed
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
14 years 11 months ago
On properties of random dissections and triangulations
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
RSA
2006
110views more  RSA 2006»
14 years 9 months ago
The degree sequences and spectra of scale-free random graphs
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Do...
Jonathan Jordan