Weak-order extensions of an order.

DOI10.1016/S0304-3975(03)00132-4zbMath1045.68150MaRDI QIDQ1401400

Michel Morvan, Karell Bertet, Jens Gustedt

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

AlgorithmComplexityGraphExtension of an orderPartial orderWeak-order

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

On the random generation and counting of weak order extensions of a poset with given class cardinalities

Cites Work

• Comparability invariance of the fixed point property
• Parallel concepts in graph theory
• Computing on-line the lattice of maximal antichains of posets
• AN OVERVIEW OF Λ-TYPE OPERATIONS ON QUASI-SYMMETRIC FUNCTIONS
• Combinatorial Gray Codes
• Un domaine très ouvert : les problèmes d'ordonnancement
• Time, clocks, and the ordering of events in a distributed system
• Generating Linear Extensions Fast
• On the generation of all topological sortings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weak-order extensions of an order.