On-line Adaptive Chain Covering of Upgrowing Posets

We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time. The other one (Algorithm) assigns new point to a chain. Kierstead gave a strategy for Algorithm showing that width w posets can be on-line c...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník DMTCS Proceedings vol. AF,...; číslo Proceedings; s. 37 - 48
Hlavní autori:	Bosek, Bartłomiej, Micek, Piotr
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	DMTCS 01.01.2005 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Edícia:	DMTCS Proceedings
Predmet:	[info.info-hc] computer science [cs]/human-computer interaction [cs.hc] [info.info-lo] computer science [cs]/logic in computer science [cs.lo] [info.info-sc] computer science [cs]/symbolic computation [cs.sc] chain partition Computer Science Human-Computer Interaction Logic in Computer Science on-line algorithm order poset Symbolic Computation chain partition on-line algorithm poset order
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!