Pages that link to "Item:Q803172"
From MaRDI portal
The following pages link to On an edge ranking problem of trees and graphs (Q803172):
Displaying 28 items.
- List rankings and on-line list rankings of graphs (Q266945) (← links)
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← 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)
- On vertex ranking of a starlike graph (Q1603539) (← links)
- \(l_p\)-optimal rankings and max-optimal rankings are different (Q1696534) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- Optimal edge ranking of trees in polynomial time (Q1892584) (← 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)
- The complexity of restricted star colouring (Q2161257) (← links)
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975) (← links)
- Easy and hard instances of arc ranking in directed graphs (Q2462400) (← links)
- Edge ranking of weighted trees (Q2495900) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- Graphs with large rank numbers and rank numbers of subdivided stars (Q5154613) (← 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)
