Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Greedy linear extensions with constraints

From MaRDI portal
Publication:1821122
Jump to:navigation, search

DOI10.1016/0012-365X(87)90014-8zbMath0616.05060MaRDI QIDQ1821122

Nejib Zaguia, Ivan Rival

Publication date: 1987

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


zbMATH Keywords

greedy linear extensionN-free posetW-free poset


Mathematics Subject Classification ID

Partial orders, general (06A06) Deterministic scheduling theory in operations research (90B35) Graph theory (05C99)


Related Items

Greedy posets for the bump-minimizing problem, Representing an ordered set as the intersection of super greedy linear extensions, On minimizing the jump number for interval orders, Obituary: Ivan Rival



Cites Work

  • On the greedy dimension of a partial order
  • Greedy linear extensions to minimize jumps
  • Constructing greedy linear extensions by interchanging chains
  • Optimal Linear Extensions by Interchanging Chains
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1821122&oldid=14183252"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki