Optimal edge ranking of trees in linear time
From MaRDI portal
Recommendations
Cited in
(26)- Optimal node ranking of trees
- Results on communication complexity classes
- Binary search in graphs revisited
- Optimal node ranking of tree in linear time
- Optimal edge ranking of trees in polynomial time
- Finding the edge ranking number through vertex partitions
- Conflict-free connection of trees
- An efficient noisy binary search in graphs via Median approximation
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
- scientific article; zbMATH DE number 437538 (Why is no real title available?)
- scientific article; zbMATH DE number 15358 (Why is no real title available?)
- scientific article; zbMATH DE number 1303585 (Why is no real title available?)
- Binary search in graphs revisited
- Fast sequential and parallel vertex relabelings of \({K_{m,m}}\)
- Optimal edge ranking of complete bipartite graphs in polynomial time
- The complexity of bicriteria tree-depth
- The complexity of bicriteria tree-depth
- A survey on conflict-free connection coloring of graphs
- Tight approximation bounds on a simple algorithm for minimum average search time in trees
- Noisy (binary) searching: simple, fast and correct
- Randomized binary and tree search under pressure
- On an edge ranking problem of trees and graphs
- Minimum edge ranking spanning trees of split graphs
- Constructing a minimum height elimination tree of a tree in linear time
- Optimal vertex ranking of block graphs
This page was built for publication: Optimal edge ranking of trees in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943825)
