Finding minimum clique capacity (Q2392036): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00493-012-2891-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2121150643 / rank | |||
Normal rank | |||
Revision as of 23:27, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding minimum clique capacity |
scientific article |
Statements
Finding minimum clique capacity (English)
0 references
6 August 2013
0 references
Let \(C\) be a clique of a graph \(G\). The capacity of \(C\) is defined to be \((| V(G) \setminus C| + | D|)/2\), where \(D\) is the set of vertices in \(V(G) \setminus C\) that have both a neighbor and a non-neighbor in \(C\). The main result of this paper states that there is an algorithm, with running time \(O(n^{3.5})\), which with input an \(n\)-vertex graph \(G\), finds a clique \(C\) in \(G\) with minimum capacity.
0 references
capacity
0 references
Hadwiger's conjecture
0 references
packing
0 references
