|
|
| |
| University of Bonn -> Department of Computer Science -> Chair V | ||
| CS-Reports 1985-1989 | Copyright 1985-1989 University of Bonn, Department of Computer Science, Abt. V | |
|
858
|
Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem
Elias Dahlhaus, Marek Karpinski [Download PostScript] [Download PDF] We shall prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-connected 4-regular graphs) is AC°-equivalent with the general perfect matching problem for arbitrary graphs. |
|
|
Last Change:
11/20/08 at 14:26:15
|
University of Bonn -> Department of Computer Science -> Chair V | |