A \(O(m)\) self-stabilizing algorithm for maximal triangle partition of general graphs (Q4598938)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6819514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(O(m)\) self-stabilizing algorithm for maximal triangle partition of general graphs |
scientific article; zbMATH DE number 6819514 |
Statements
A <i>O</i>(<i>m</i>) Self-Stabilizing Algorithm for Maximal Triangle Partition of General Graphs (English)
0 references
15 December 2017
0 references
self-stabilizing algorithms
0 references
triangle partition
0 references
triangle packing
0 references
tripartite matching
0 references
fault-tolerance
0 references
0.8125622868537903
0 references
0.7705509662628174
0 references
