Coloring Clique-free Graphs in Linear Expected Time (Q4019373): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.3240030404 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2171919542 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3852212 / rank | |||
Normal rank | |||
Latest revision as of 15:11, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring Clique-free Graphs in Linear Expected Time |
scientific article |
Statements
Coloring Clique-free Graphs in Linear Expected Time (English)
0 references
16 January 1993
0 references
coloring clique-free graphs
0 references
linear expected time algorithm
0 references
number of graphs
0 references
