| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ Fed Rio Grande do Sul, Inst Matemat & Estat, Porto Alegre, RS - Brazil
[2] Monash Univ, Sch Math Sci, Clayton, Vic - Australia
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | COMBINATORICA; v. 38, n. 3, p. 619-664, JUN 2018. |
| Web of Science Citations: | 2 |
| Abstract | |
We introduce a general class of algorithms and analyse their application to regular graphs of large girth. In particular, we can transfer several results proved for random regular graphs into (deterministic) results about all regular graphs with sufficiently large girth. This reverses the usual direction, which is from the deterministic setting to the random one. In particular, this approach enables, for the first time, the achievement of results equivalent to those obtained on random regular graphs by a powerful class of algorithms which contain prioritised actions. As a result, we obtain new upper or lower bounds on the size of maximum independent sets, minimum dominating sets, maximum k-independent sets, minimum k-dominating sets and maximum k-separated matchings in r-regular graphs with large girth. (AU) | |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |