Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs (Q2132367)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs |
scientific article |
Statements
Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs (English)
0 references
27 April 2022
0 references
stretch index
0 references
graphs with few \(P_4\)'s
0 references
\((k, \ell)\)-graphs
0 references
\((2, 1)\)-chordal graphs
0 references
\textsf{P} vs \textsf{NP}-c dichotomy
0 references
