Редукция графа при поиске реберного покрытия минимальным числом клик (Q4959050): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2789394248 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Data Reduction, Exact, and Heuristic Algorithms for Clique Cover / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering edges by cliques with regard to keyword conflicts and intersection graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4152571 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple lower bound on edge coverings by cliques / rank | |||
Normal rank | |||
Latest revision as of 14:50, 26 July 2024
scientific article; zbMATH DE number 7395946
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Редукция графа при поиске реберного покрытия минимальным числом клик |
scientific article; zbMATH DE number 7395946 |
Statements
Редукция графа при поиске реберного покрытия минимальным числом клик (English)
0 references
15 September 2021
0 references
classes of graphs
0 references
graph coverings
0 references
cliques
0 references
