Partitioning the edge set of a bipartite graph into chain packings: complexity of some variations
2003
Details
Title
Partitioning the edge set of a bipartite graph into chain packings: complexity of some variations
Author(s)
de Werra, D.
Published in
Linear Algebra and its Applications
Volume
268
Pages
315-327
Date
2003
Other identifier(s)
DAR: 3840
View record in Web of Science
View record in Web of Science
Laboratories
ROSE
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > 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
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2006-08-16