Analysis of greedy algorithms on graphs with bounded degrees (Q1417582): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(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: Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3682518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum independent dominating sets of random cubic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximum induced matchings of random cubic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the independence number of random cubic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3251608 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5843703 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Differential equations for random processes and random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4263664 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4938890 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4944970 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4796200 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:33, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Analysis of greedy algorithms on graphs with bounded degrees |
scientific article |
Statements
Analysis of greedy algorithms on graphs with bounded degrees (English)
0 references
5 January 2004
0 references
Random graph
0 references
Regular graph
0 references
Greedy algorithm
0 references
Differential equations
0 references
Dominating set
0 references
Independent set
0 references
0 references