The complexity of bicriteria tree-depth
From MaRDI portal
Publication:5918682
DOI10.1007/978-3-030-86593-1_7OpenAlexW3199254404MaRDI QIDQ5918682
Piotr Borowiecki, Dorota Osula, Dariusz Dereniowski
Publication date: 20 May 2022
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.06645
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the tree search problem with non-uniform costs
- Searching in random partially ordered sets
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- On an edge ranking problem of trees and graphs
- Vertex rankings of chordal graphs and weighted trees
- Edge ranking and searching in partial orders
- Optimal node ranking of trees
- Edge ranking of graphs is hard
- The binary identification problem for weighted trees
- Optimal node ranking of tree in linear time
- Optimal edge ranking of trees in polynomial time
- Tree-depth, subgraph coloring and homomorphism bounds
- Edge ranking of weighted trees
- On Minimum Edge Ranking Spanning Trees
- On Binary Searching with Nonuniform Costs
- Vertex Ranking with Capacity
- The Role of Elimination Trees in Sparse Factorization
- Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
- Optimal Search in Trees
- Rankings of Graphs
- Optimal edge ranking of trees in linear time
This page was built for publication: The complexity of bicriteria tree-depth
