scientific article; zbMATH DE number 975401

zbMATH Open0862.05025MaRDI QIDQ5284078FDOQ5284078

Authors: Jitender Deogun, Yiping Peng 

Publication date: 19 May 1997

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

labelingtreesapproximation algorithmNP-hardpolynomial algorithmlabeledge ranking

Mathematics Subject Classification ID

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

Cited In (9)

• A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
• Rankings of graphs
• Optimal edge ranking of trees in linear time
• Optimal vertex ranking of block graphs
• Optimal edge ranking of trees in polynomial time
• Title not available (Why is that?)
• Edge ranking of weighted trees
• On minimum edge ranking spanning trees
• Generalized edge-rankings of trees (extended abstract)

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)