Shortcuts, diversions, and maximal chains in partially ordered sets

DOI10.1016/S0012-365X(73)80007-XzbMath0258.06003MaRDI QIDQ2559393

David Sankoff, Peter H. Sellers

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

06A06: Partial orders, general

05C35: Extremal problems in graph theory

90B35: Deterministic scheduling theory in operations research

90B20: Traffic problems in operations research

Related Items

A survey of multiple sequence comparison methods, A fast and practical bit-vector algorithm for the longest common subsequence problem

Cites Work

• Matching Sequences under Deletion/Insertion Constraints
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Unnamed Item