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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom