|
|||||
|
|
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs |
|
| Affiliation: | Department of Industrial and Systems Engineering, Faculty of Science and Engineering, Hosei University, Tokyo 184-8584, Japan |
| Abstract: | |
| Keywords: | Combinatorial algorithm Matching theory Traveling salesman problem Restricted 2-matching Subtour elimination constraint Hamilton-laceable graph |
| 本文献已被 ScienceDirect 等数据库收录！ | |