The complexity of bicriteria tree-depth
From MaRDI portal
Publication:5925612
DOI10.1016/j.tcs.2022.12.032OpenAlexW3124350660MaRDI QIDQ5925612
Dorota Osula, Piotr Borowiecki, Dariusz Dereniowski
Publication date: 1 February 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.12.032
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the tree search problem with non-uniform costs
- Forbidden graphs for tree-depth
- 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
- On low tree-depth decompositions
- Edge ranking and searching in partial orders
- 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
- Ordered colourings
- On vertex rankings of graphs and its relatives
- 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
- On-Line Vertex Ranking of Trees
- The Role of Elimination Trees in Sparse Factorization
- Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
- Optimal Search in Trees
- Rankings of Graphs
- Deterministic and probabilistic binary search in graphs
- Optimal edge ranking of trees in linear time
This page was built for publication: The complexity of bicriteria tree-depth
