Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Partitioning the edge set of a bipartite graph into chain packings: complexity of some variations
 
Loading...
Thumbnail Image
research article

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

de Werra, D.  
2003
Linear Algebra and its Applications
  • Details
  • Metrics
Type
research article
DOI
10.1016/S0024-3795(02)00691-2
Web of Science ID

WOS:000183665000020

Author(s)
de Werra, D.  
Date Issued

2003

Published in
Linear Algebra and its Applications
Volume

268

Start page

315

End page

327

Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
ROSE  
Available on Infoscience
August 16, 2006
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/233064
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés