Home > Partitioning the edge set of a bipartite graph into chain packings: complexity of some variations
 

Partitioning the edge set of a bipartite graph into chain packings: complexity of some variations

de Werra, D.

Published in:
Linear Algebra and its Applications, 268, 315-327
Year:
2003
Other identifiers:
DAR: 3840
View record in Web of Science
Laboratories:
ROSE

Record appears in:
Scientific production and competences > Archives > SB - School of Basic Sciences > ROSE - Chair of Operations Research SE
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published



 Record created 2006-08-16, last modified 2018-12-03


Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)