Generating labeled planar graphs uniformly at random

Manuel Bodirsky; Clemens Gröpl; Mihyun Kang

doi:10.1016/j.tcs.2007.02.045

ScienceGate Book Chapters

JOURNAL ARTICLE

Generating labeled planar graphs uniformly at random

Manuel Bodirsky Clemens Gröpl Mihyun Kang

Year: 2007 Journal: Theoretical Computer Science Vol: 379 (3)Pages: 377-386 Publisher: Elsevier BV

DOI: 10.1016/j.tcs.2007.02.045

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Planar graph Combinatorics Planar Discrete mathematics Planar straight-line graph Random graph Time complexity Graph 1-planar graph Chordal graph Computer science

Metrics

Cited By

4.27

FWCI (Field Weighted Citation Impact)

Refs

0.94

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Algorithms and Data Compression

Physical Sciences → Computer Science → Artificial Intelligence

Stochastic processes and statistical mechanics

Physical Sciences → Mathematics → Mathematical Physics

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

Generating labeled planar graphs uniformly at random

Metrics

Citation History

Topics

Related Documents

Generating Labeled Planar Graphs Uniformly at Random

Generating unlabeled connected cubic planar graphs uniformly at random

Generating Graphs Uniformly at Random

Generating Outerplanar Graphs Uniformly at Random

Generating random connected planar graphs