Searching in Trees, Series-Parallel and Interval Orders
From MaRDI portal
(Redirected from Publication:3756532)
Recommendations
- On the complexity of searching in trees and partially ordered structures
- Searching in dynamic tree-like partial orders
- scientific article; zbMATH DE number 1173838
- Series - parallel graphs and depth-first search trees
- Optimal Search in Trees
- scientific article; zbMATH DE number 2101003
- Breadth-first traversal of trees and integer sorting in parallel
- Fast searching in trees
- Sorting strings and constructing digital search trees in parallel
Cited in
(14)- On the computational complexity of the order polynomial
- Searching ordered structures
- Series-parallel posets and the Tutte polynomial
- Cross-series-parallel digraphs
- scientific article; zbMATH DE number 2086235 (Why is no real title available?)
- Understanding the generalized median stable matchings
- On the complexity of dynamic programming for sequencing problems with precedence constraints
- On estimating the number of order ideals in partial orders, with some applications
- Algorithmic combinatorics based on slicing posets
- Improved approximation algorithms for the average-case tree searching problem
- On the complexity of searching in trees and partially ordered structures
- On complexity of maximizatin of submodular functions*
- On generalized comparison-based sorting problems
- scientific article; zbMATH DE number 2101003 (Why is no real title available?)
This page was built for publication: Searching in Trees, Series-Parallel and Interval Orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756532)
