Generalized edge-rankings of trees (extended abstract)
From MaRDI portal
Publication:6550561
DOI10.1007/3-540-62559-3_31zbMATH Open1539.68241MaRDI QIDQ6550561
Md. Abul Kashem, Xiao Zhou, Takao Nishizeki
Publication date: 5 June 2024
Analysis of algorithms (68W40) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On an edge ranking problem of trees and graphs
- Optimal node ranking of trees
- Optimal node ranking of tree in linear time
- Optimal edge ranking of trees in polynomial time
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Rankings of graphs
This page was built for publication: Generalized edge-rankings of trees (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550561)
