Packing non-returning A-paths algorithmically - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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

Fichier principal
Vignette du fichier
dmAE0128.pdf (167.08 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184355 , version 1 (14-08-2015)

Identifiers

Cite

Gyula Pap. Packing non-returning A-paths algorithmically. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.139-144, ⟨10.46298/dmtcs.3399⟩. ⟨hal-01184355⟩

Collections

INSMI TDS-MACS
27 View
649 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More