Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S00224-014-9568-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00224-014-9568-2 / rank | |||
Normal rank | |||
Latest revision as of 12:47, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs |
scientific article |
Statements
Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (English)
0 references
21 March 2016
0 references
sparsest \(k\)-subgraph
0 references
approximation algorithm
0 references
chordal graphs
0 references
0 references
