Finding minimum clique capacity
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chudnovsky, Maria | ko |
| dc.contributor.author | Oum, Sang-il | ko |
| dc.contributor.author | Seymour, Paul | ko |
| dc.date.accessioned | 2013-03-12T21:39:14Z | - |
| dc.date.available | 2013-03-12T21:39:14Z | - |
| dc.date.created | 2012-10-09 | - |
| dc.date.created | 2012-10-09 | - |
| dc.date.created | 2012-10-09 | - |
| dc.date.issued | 2012-04 | - |
| dc.identifier.citation | COMBINATORICA, v.32, no.3, pp.283 - 287 | - |
| dc.identifier.issn | 0209-9683 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/103598 | - |
| dc.description.abstract | Let C be a clique of a graph G. The capacity of C is defined to be (|V (G)\C|+|D|)/2, where D is the set of vertices in V (G)\C that have both a neighbour and a non-neighbour in C. We give a polynomial-time algorithm to find the minimum clique capacity in a graph G. This problem arose in the study [1] of packing vertex-disjoint induced three-vertex paths in a graph with no stable set of size three, which in turn was motivated by Hadwiger's conjecture. | - |
| dc.language | English | - |
| dc.publisher | SPRINGER | - |
| dc.title | Finding minimum clique capacity | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000308285700002 | - |
| dc.identifier.scopusid | 2-s2.0-84865810649 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 32 | - |
| dc.citation.issue | 3 | - |
| dc.citation.beginningpage | 283 | - |
| dc.citation.endingpage | 287 | - |
| dc.citation.publicationname | COMBINATORICA | - |
| dc.identifier.doi | 10.1007/s00493-012-2891-9 | - |
| dc.contributor.localauthor | Oum, Sang-il | - |
| dc.contributor.nonIdAuthor | Chudnovsky, Maria | - |
| dc.contributor.nonIdAuthor | Seymour, Paul | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.