On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs

13 years 6 months ago

Download www.as.inf.ethz.ch

In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of the uniform distribution on the class of all graphs on a given vertex set, a 'typical' input instance can be viewed as a random graph in the Erdos-Renyi model

Nicla Bernasconi, Konstantinos Panagiotou, Angelik

Real-time Traffic

Algorithms | APPROX 2008 | Input Instance | Planar Graphs | Random Graphs |

claim paper

» Orthogonal Drawings of SeriesParallel Graphs with Minimum Bends

» Approximately Counting Embeddings into Random Graphs

» Hamilton Cycles in Random Graphs with a Fixed Degree Sequence

» Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems

» The scaling window for a random graph with a given degree sequence

» The Size of the Giant Component of a Random Graph with a Given Degree Sequence

» On properties of random dissections and triangulations

» The degree sequences and spectra of scalefree random graphs

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	APPROX
Authors	Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger

Comments (0)

Sciweavers

On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs

Algorithms | APPROX 2008 | Input Instance | Planar Graphs | Random Graphs |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers