z-logo
open-access-imgOpen Access
Computational complexity of maximum distance-(k, l) matchings in graphs
Author(s) -
Nadia Brauner,
Gerd Finke,
Vincent Jost,
Mikhail Y. Kovalyov,
Yury Orlovich,
Ph. V. Pronin,
Ariel Waserhole
Publication year - 2011
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - computational complexity theory , computer science , combinatorics , mathematics , algorithm

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom