Finding minimum clique capacity (Q2392036): Difference between revisions
From MaRDI portal
Changed an 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 / 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 | |||
Property / cites work | |||
Property / cites work: Packing seagulls / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank |
Latest revision as of 17:08, 6 July 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