Show simple item record

Degree-constrained edge partitionings in graphs arising from discrete tomography

dc.contributor.authorBernard Ries
dc.contributor.authorPicouleau, Christophe
HAL ID: 181059
ORCID: 0000-0001-8092-1923
dc.contributor.authorde Werra, Dominique
dc.contributor.authorCosta, Marie-Christine
HAL ID: 4529
dc.contributor.authorBentz, Cédric
HAL ID: 181270
dc.date.accessioned2011-10-06T10:41:42Z
dc.date.available2011-10-06T10:41:42Z
dc.date.issued2009
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/7129
dc.language.isoenen
dc.subjecttomographyen
dc.subjectDegree-constraineden
dc.subjectvertex disjoint chainsen
dc.subjecttreeen
dc.subjectBipartite graphen
dc.subject.ddc006.3en
dc.titleDegree-constrained edge partitionings in graphs arising from discrete tomographyen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherEcole Polytechnique F ed erale de Lausanne;France
dc.contributor.editoruniversityotherCEDRIC Laboratory CNAM;France
dc.contributor.editoruniversityotherLRI, Université Paris-Sud and CNRS;France
dc.description.abstractenStarting from the basic problem of reconstructing a 2-dimensional image given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k = 3 colors is open. Variations and special cases are considered for the case k = 3 colors where the graph corresponding to the union of some color classes (for instance colors 1 and 2) has a given structure (tree, vertex-disjoint chains, 2-factor, etc.). We also study special cases corresponding to the search of 2 edge-disjoint chains or cycles going through specied vertices. A variation where the graph is oriented is also presented. In addition we explore similar problems for the case where the underlying graph is a complete graph (instead of a complete bipartite graph).en
dc.relation.isversionofjnlnameJournal of Graph Algorithms and Applications
dc.relation.isversionofjnlvol13en
dc.relation.isversionofjnlissue2en
dc.relation.isversionofjnldate2009
dc.relation.isversionofjnlpages99-118en
dc.description.sponsorshipprivateouien
dc.subject.ddclabelIntelligence artificielleen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record