scientific article; zbMATH DE number 5844196

zbMATH Open1224.05441MaRDI QIDQ3070239FDOQ3070239

Authors Dariusz Dereniowski 

Publication date 2 February 2011

zbMATH Keywords

complexityranking numberpolynomially solvable

Mathematics Subject Classification ID

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

Recommendations

• Enumerating, Ranking and Unranking Binary Trees
• scientific article; zbMATH DE number 4041938
• scientific article; zbMATH DE number 568846
• Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
• Tree enumeration and tree algorithm complexity computation
• scientific article; zbMATH DE number 4008409
• Ranking and unranking trees using regular reductions
• Ranking and Unranking of Non-regular Trees
• Optimal edge ranking of trees in polynomial time
• scientific article; zbMATH DE number 437538

Cited In (6)

• List rankings and on-line list rankings of graphs
• Boundary classes for the list-ranking problems in the case of forests
• Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
• Classes of graphs critical for the edge list-ranking problem
• Critical hereditary graph classes: a survey
• Minimum vertex ranking spanning tree problem for chordal and proper interval 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 Q3070239)