Geodesic
The analysis of a prioritised probabilistic algorithm to find large induced forests in regular graphs with large girth
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010).

Voir la notice de l'article provenant de la source Episciences

The analysis of probabilistic algorithms has proved to be very successful for finding asymptotic bounds on parameters of random regular graphs. In this paper, we show that similar ideas may be used to obtain deterministic bounds for one such parameter in the case of regular graphs with large girth. More precisely, we address the problem of finding a large induced forest in a graph $G$, by which we mean an acyclic induced subgraph of $G$ with a lot of vertices. For a fixed integer $r \geq 3$, we obtain new lower bounds on the size of a maximum induced forest in graphs with maximum degree $r$ and large girth. These bounds are derived from the solution of a system of differential equations that arises naturally in the analysis of an iterative probabilistic procedure to generate an induced forest in a graph. Numerical approximations suggest that these bounds improve substantially the best previous bounds. Moreover, they improve previous asymptotic lower bounds on the size of a maximum induced forest in a random regular graph. 
@article{DMTCS_2010_special_258_a5,
     author = {Hoppen, Carlos},
     title = {The analysis of a prioritised probabilistic algorithm to find large induced forests in regular graphs with large girth},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)},
     year = {2010},
     doi = {10.46298/dmtcs.2769},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2769/}
}
TY  - JOUR
AU  - Hoppen, Carlos
TI  - The analysis of a prioritised probabilistic algorithm to find large induced forests in regular graphs with large girth
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2769/
DO  - 10.46298/dmtcs.2769
LA  - en
ID  - DMTCS_2010_special_258_a5
ER  - 
%0 Journal Article
%A Hoppen, Carlos
%T The analysis of a prioritised probabilistic algorithm to find large induced forests in regular graphs with large girth
%J Discrete mathematics & theoretical computer science
%D 2010
%V DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2769/
%R 10.46298/dmtcs.2769
%G en
%F DMTCS_2010_special_258_a5
Hoppen, Carlos. The analysis of a prioritised probabilistic algorithm to find large induced forests in regular graphs with large girth. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010). doi : 10.46298/dmtcs.2769. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2769/

Cité par Sources :