Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267)
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: Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs |
scientific article; zbMATH DE number 6558705
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs |
scientific article; zbMATH DE number 6558705 |
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
0.99284256
0 references
0.95494145
0 references
0.9218839
0 references
0.9018924
0 references
0 references
0.8874447
0 references
0 references
0.88485765
0 references
