scientific article; zbMATH DE number 975401

MaRDI QIDQ5284078zbMATH OpenFDO

Authors Jitender Deogun, Yiping Peng

Publication date 19 May 1997

zbMATH Keywords

approximation algorithmedge rankinglabellabelingNP-hardpolynomial algorithmtrees

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On an edge ranking problem of trees and graphs
• Publication:4886041
• scientific article; zbMATH DE number 437538

Cited in

(10)

• Optimal edge ranking of trees in polynomial time
• A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
• Edge ranking of weighted trees
• On minimum edge ranking spanning trees
• scientific article; zbMATH DE number 910867 (Why is no real title available?)
• Optimal edge ranking of trees in linear time
• Rankings of graphs
• Generalized edge-rankings of trees (extended abstract)
• On an edge ranking problem of trees and graphs
• Optimal vertex ranking of block graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284078)