An Efficient On-Line Algorithm for Edge-Ranking of Trees
An edge-ranking of a graph G is a labeling of the edges of G with positive integers such that every path between two edges with the same label ° contains an edge with label ¸ > °. In the on-line edge-ranking model the edges e1; e2 : : : ; em arrive one at a time in any order, where m is the n...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2008
|
| Assuntos: | |
| Texto completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/213 |
| País: | Brasil |
| Oai: | oai:infocomp.dcc.ufla.br:article/213 |