Complexity aspects of the computation of the rank of a graph (Q2928582)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity aspects of the computation of the rank of a graph |
scientific article; zbMATH DE number 6367131
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity aspects of the computation of the rank of a graph |
scientific article; zbMATH DE number 6367131 |
Statements
10 November 2014
0 references
algorithms
0 references
complexity
0 references
graph convexity
0 references
\(P_3\)-convexity
0 references
rank
0 references
0 references
0.91290784
0 references
0 references
0.89888895
0 references
Complexity aspects of the computation of the rank of a graph (English)
0 references
