External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem

Anders Dessmark, Andrzej Lingas, Oscar Garrido. On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem. In Igor Prívara, Branislav Rovan, Peter Ruzicka, editors, Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS 94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings. Volume 841 of Lecture Notes in Computer Science, pages 316-325, Springer, 1994.

Authors

Anders Dessmark

This author has not been identified. Look up 'Anders Dessmark' in Google

Andrzej Lingas

This author has not been identified. Look up 'Andrzej Lingas' in Google

Oscar Garrido

This author has not been identified. Look up 'Oscar Garrido' in Google
runs on