- Tytuł:
- Optimal edge ranking of complete bipartite graphs in polynomial time
- Autorzy:
- Hung, Ruo-Wei
- Powiązania:
- https://bibliotekanauki.pl/articles/743901.pdf
- Data publikacji:
- 2006
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
graph algorithms
edge ranking
vertex ranking
edge-separator tree
complete bipartite graphs - Opis:
- An edge ranking of a graph is a labeling of edges using positive integers such that all paths connecting two edges with the same label visit an intermediate edge with a higher label. An edge ranking of a graph is optimal if the number of labels used is minimum among all edge rankings. As the problem of finding optimal edge rankings for general graphs is NP-hard [12], it is interesting to concentrate on special classes of graphs and find optimal edge rankings for them efficiently. Apart from trees and complete graphs, little has been known about special classes of graphs for which the problem can be solved in polynomial time. In this paper, we present a polynomial-time algorithm to find an optimal edge ranking for a complete bipartite graph by using the dynamic programming strategy.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2006, 26, 1; 149-159
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł