Computing dense and sparse subgraphs of weakly closed graphs (Q6107896): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-022-01090-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-022-01090-Z / rank | |||
Normal rank | |||
Latest revision as of 19:31, 30 December 2024
scientific article; zbMATH DE number 7704072
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing dense and sparse subgraphs of weakly closed graphs |
scientific article; zbMATH DE number 7704072 |
Statements
Computing dense and sparse subgraphs of weakly closed graphs (English)
0 references
28 June 2023
0 references
fixed-parameter tractability
0 references
\(c\)-closure
0 references
degeneracy
0 references
clique relaxations
0 references
bicliques
0 references
dominating set
0 references
0 references
0 references
0 references
