Geodesic
Packing non-returning A-paths algorithmically
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005).

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

In this paper we present an algorithmic approach to packing A-paths. It is regarded as a generalization of Edmonds' matching algorithm, however there is the significant difference that here we do not build up any kind of alternating tree. Instead we use the so-called 3-way lemma, which either provides augmentation, or a dual, or a subgraph which can be used for contraction. The method works in the general setting of packing non-returning A-paths. It also implies an ear-decomposition of criticals, as a generalization of the odd ear-decomposition of factor-critical graph. 
@article{DMTCS_2005_special_250_a8,
     author = {Pap, Gyula},
     title = {Packing non-returning {A-paths} algorithmically},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     year = {2005},
     doi = {10.46298/dmtcs.3399},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3399/}
}
TY  - JOUR
AU  - Pap, Gyula
TI  - Packing non-returning A-paths algorithmically
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3399/
DO  - 10.46298/dmtcs.3399
LA  - en
ID  - DMTCS_2005_special_250_a8
ER  - 
%0 Journal Article
%A Pap, Gyula
%T Packing non-returning A-paths algorithmically
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3399/
%R 10.46298/dmtcs.3399
%G en
%F DMTCS_2005_special_250_a8
Pap, Gyula. Packing non-returning A-paths algorithmically. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi : 10.46298/dmtcs.3399. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3399/

Cité par Sources :