Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs (Q4844489): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Fast Perfect-Matching Algorithm in Random Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The asymptotic number of labeled graphs with given degree sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Randomized greedy matching / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1017/s0963548300001474 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2060269923 / rank | |||
Normal rank |
Latest revision as of 11:35, 30 July 2024
scientific article; zbMATH DE number 790736
Language | Label | Description | Also known as |
---|---|---|---|
English | Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs |
scientific article; zbMATH DE number 790736 |
Statements
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs (English)
0 references
27 August 1995
0 references
greedy matching algorithm
0 references
random cubic graphs
0 references