scientific article; zbMATH DE number 910867

MaRDI QIDQ4886041zbMATH OpenFDO

Authors Xiao Zhou, Takao Nishizeki

Publication date 23 September 1996

zbMATH Keywords

treealgorithmslabelingedge-coloringNP-completevertex-rankingedge-ranking

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 437538
• scientific article; zbMATH DE number 1303585
• Optimal edge ranking of trees in polynomial time
• On an edge ranking problem of trees and graphs
• scientific article; zbMATH DE number 975401

Cited in

(11)

• The complexity of bicriteria tree-depth
• The complexity of bicriteria tree-depth
• Optimal vertex ranking of block graphs
• Optimal edge ranking of trees in linear time
• Optimal node ranking of tree in linear time
• Optimal edge ranking of trees in polynomial time
• scientific article; zbMATH DE number 15358 (Why is no real title available?)
• Edge ranking of weighted trees
• On minimum edge ranking spanning trees
• scientific article; zbMATH DE number 437538 (Why is no real title available?)
• 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 Q4886041)