scientific article; zbMATH DE number 1088275

MaRDI QIDQ4364591zbMATH OpenFDO

Authors Md. Abul Kashem, Xiao Zhou, Takao Nishizeki

Publication date 23 February 1998

zbMATH Keywords

bounded treewidthvertex rankingpartial \(k\)-treeseparator tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Algorithms for generalized vertex-rankings of partial k-trees
• Vertex rankings of chordal graphs and weighted trees
• The minimum semidefinite rank of the complement of partial \(k\)-trees
• Generation, ranking and unranking of ordered trees with degree bounds
• On vertex rankings of graphs and its relatives
• Generalized k-d-trees and local reorganizations
• Algorithms and Computation
• scientific article; zbMATH DE number 1341910
• On the number of vertices of each rank in phylogenetic trees and their generalizations
• Vertex partitioning problems on partial k-trees

Cited in

(3)

• Algorithms for generalized vertex-rankings of partial k-trees
• Algorithms and Computation
• Edge ranking of weighted trees

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 Q4364591)