Packing non-returning A-paths algorithmically

Abstract : 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.
Keywords : A-paths matching
Type de document :
Communication dans un congrès
Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.139-144, 2005, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184355
Contributeur : Coordination Episciences Iam <>
Soumis le : vendredi 14 août 2015 - 11:37:05
Dernière modification le : jeudi 11 mai 2017 - 01:03:05
Document(s) archivé(s) le : dimanche 15 novembre 2015 - 10:58:55

Fichier

dmAE0128.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184355, version 1

Collections

Citation

Gyula Pap. Packing non-returning A-paths algorithmically. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.139-144, 2005, DMTCS Proceedings. 〈hal-01184355〉

Partager

Métriques

Consultations de la notice

99

Téléchargements de fichiers

249