Searching in Trees, Series-Parallel and Interval Orders
From MaRDI portal
Publication:3756532
DOI10.1137/0215077zbMath0619.68057WikidataQ116185938 ScholiaQ116185938MaRDI QIDQ3756532
Ulrich Faigle, György Turán, László Lovász, Rainer Schrader
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
68Q25: Analysis of algorithms and problem complexity
06A06: Partial orders, general
68P10: Searching and sorting
Related Items
On complexity of maximizatin of submodular functions*, Improved approximation algorithms for the average-case tree searching problem, On the complexity of searching in trees and partially ordered structures, On the complexity of dynamic programming for sequencing problems with precedence constraints, On the computational complexity of the order polynomial, On estimating the number of order ideals in partial orders, with some applications, Series-parallel posets and the Tutte polynomial, Understanding the generalized median stable matchings, Cross-series-parallel digraphs, Algorithmic combinatorics based on slicing posets, On Generalized Comparison-Based Sorting Problems