Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6558705 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sparsest \(k\)-subgraph | |||
| Property / zbMATH Keywords: sparsest \(k\)-subgraph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation algorithm | |||
| Property / zbMATH Keywords: approximation algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
chordal graphs | |||
| Property / zbMATH Keywords: chordal graphs / rank | |||
Normal rank | |||
Revision as of 13:15, 27 June 2023
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
