Pages that link to "Item:Q1892584"

The following pages link to Optimal edge ranking of trees in polynomial time (Q1892584):

Displaying 24 items.

• On the tree search problem with non-uniform costs (Q306704) (← links)
• Forbidden graphs for tree-depth (Q412288) (← links)
• Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
• Facial edge ranking of plane graphs (Q494424) (← links)
• On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
• LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
• Minimum edge ranking spanning trees of split graphs (Q860397) (← links)
• NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (Q860400) (← links)
• Optimal vertex ranking of block graphs (Q958305) (← links)
• Edge ranking of graphs is hard (Q1392547) (← links)
• Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
• \(l_p\)-optimal rankings and max-optimal rankings are different (Q1696534) (← links)
• The binary identification problem for weighted trees (Q1758172) (← links)
• Finding the edge ranking number through vertex partitions (Q1949112) (← links)
• On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
• Conflict-free connection of trees (Q2051900) (← links)
• On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
• A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975) (← links)
• Edge ranking of weighted trees (Q2495900) (← links)
• On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
• Obstructions for Tree-depth (Q2851471) (← links)
• The complexity of bicriteria tree-depth (Q5918682) (← links)
• The complexity of bicriteria tree-depth (Q5925612) (← links)
• A survey on conflict-free connection coloring of graphs (Q6497946) (← links)