Showing results 1 to 3 of 3
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Edge ranking of graphs is hard Journal:Discrete Applied Mathematics | 1998 | 124 | ||
The NP-completeness of edge ranking Proceeding/Conference:International Computer Symposium, ICS'96 | 1996 | 77 | ||
Optimal edge ranking of trees in linear time Journal:Algorithmica (New York) | 2001 | 98 |