An optimal algorithm to find the jump number of partially ordered sets

DOI10.1023/A:1008625405476zbMath0887.90132MaRDI QIDQ1366304

Lucio Bianco, Stefano Giordani, Paolo Dell'Olmo

Publication date: 25 May 1998

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

heuristic algorithmexact algorithmlinear extensionjump number of a partially ordered set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorics of partially ordered sets (06A07) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items

Fast Detection of Stable and Count Predicates in Parallel Computations ⋮ The arboreal jump number of an order

This page was built for publication: An optimal algorithm to find the jump number of partially ordered sets