Name
Abstract | ||
|---|---|---|
ABSTRACT A clique-transversal of a graph G is a subset of vertices intersecting all the |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10479-007-0189-x | Annals OR |
Keywords | Field | DocType |
Algorithms,Circular-arc graphs,Clique-transversals,Helly circular-arc graphs,\(\overline{3K_{2}}\),-free circular-arc graphs | Indifference graph,Chordal graph,Cardinality,Time complexity,Clique problem,Discrete mathematics,Combinatorics,Mathematical optimization,Clique,Algorithm,Hopcroft–Karp algorithm,Pathwidth,Mathematics | Journal |
Volume | Issue | ISSN |
157 | 1 | 0254-5330 |
Citations | PageRank | References |
8 | 0.47 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guillermo Durán | 1 | 296 | 29.28 |
| Min Chih Lin | 2 | 259 | 21.22 |
| Sergio Mera | 3 | 61 | 6.29 |
| Jayme Luiz Szwarcfiter | 4 | 618 | 95.79 |