Searching in Trees, Series-Parallel and Interval Orders
From MaRDI portal
Publication:3756532
DOI10.1137/0215077zbMATH Open0619.68057OpenAlexW2070004158WikidataQ116185938 ScholiaQ116185938MaRDI QIDQ3756532FDOQ3756532
U. Faigle, László Lovász, Rainer Schrader, Gy. Turán
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215077
Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)
Cited In (13)
- On the computational complexity of the order polynomial
- Series-parallel posets and the Tutte polynomial
- Cross-series-parallel digraphs
- Title not available (Why is that?)
- 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 complexity of maximizatin of submodular functions*
- On the complexity of searching in trees and partially ordered structures
- Title not available (Why is that?)
- On Generalized Comparison-Based Sorting Problems
Recommendations
- On the complexity of searching in trees and partially ordered structures 👍 👎
- Searching in dynamic tree-like partial orders 👍 👎
- Title not available (Why is that?) 👍 👎
- Series - parallel graphs and depth-first search trees 👍 👎
- Optimal Search in Trees 👍 👎
- Title not available (Why is that?) 👍 👎
- Breadth-first traversal of trees and integer sorting in parallel 👍 👎
- Fast searching in trees 👍 👎
- Sorting strings and constructing digital search trees in parallel 👍 👎
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)
