Weak-order extensions of an order
Identifieur interne : 003957 ( Crin/Curation ); précédent : 003956; suivant : 003958Weak-order extensions of an order
Auteurs : Karell Bertet ; Jens Gustedt ; Michel MorvanSource :
- Theoretical Computer Science ; 2003.
English descriptors
- KwdEn :
Abstract
In this paper, at first we describe a digraph representing all the weak-order extensions of a partially ordered set and algorithms for generating them. Then we present a digraph representing all of the minimal weak-order extensions of a partially ordered set. This digraph also implies generation algorithms. Finally, we prove that the number of weak-order extensions of a partially ordered set is a comparability invariant, whereas the number of minimal weak-order extensions of a partially ordered set is not a comparability invariant.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003957
Links to Exploration step
CRIN:bertet03aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="fr" wicri:score="-7">Weak-order extensions of an order</title></titleStmt><publicationStmt><idno type="RBID">CRIN:bertet03a</idno><date when="2003" year="2003">2003</date><idno type="wicri:Area/Crin/Corpus">003957</idno><idno type="wicri:Area/Crin/Curation">003957</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003957</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="fr">Weak-order extensions of an order</title><author><name sortKey="Bertet, Karell" sort="Bertet, Karell" uniqKey="Bertet K" first="Karell" last="Bertet">Karell Bertet</name></author><author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name></author><author><name sortKey="Morvan, Michel" sort="Morvan, Michel" uniqKey="Morvan M" first="Michel" last="Morvan">Michel Morvan</name></author></analytic><series><title level="j">Theoretical Computer Science</title><imprint><date when="2003" type="published">2003</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>algorithm</term><term>complexity</term><term>extension of an order</term><term>graph</term><term>partial order</term><term>weak-order</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1359">In this paper, at first we describe a digraph representing all the weak-order extensions of a partially ordered set and algorithms for generating them. Then we present a digraph representing all of the minimal weak-order extensions of a partially ordered set. This digraph also implies generation algorithms. Finally, we prove that the number of weak-order extensions of a partially ordered set is a comparability invariant, whereas the number of minimal weak-order extensions of a partially ordered set is not a comparability invariant.</div></front></TEI><BibTex type="article"><ref>bertet03a</ref><crinnumber>A03-R-225</crinnumber><category>1</category><equipe>L3I</equipe><author><e>Bertet, Karell</e><e>Gustedt, Jens</e><e>Morvan, Michel</e></author><title>Weak-order extensions of an order</title><journal>Theoretical Computer Science</journal><year>2003</year><volume>304</volume><number>1-3</number><pages>249-268</pages><month>Jul</month><keywords><e>partial order</e><e>algorithm</e><e>weak-order</e><e>extension of an order</e><e>graph</e><e>complexity</e></keywords><abstract>In this paper, at first we describe a digraph representing all the weak-order extensions of a partially ordered set and algorithms for generating them. Then we present a digraph representing all of the minimal weak-order extensions of a partially ordered set. This digraph also implies generation algorithms. Finally, we prove that the number of weak-order extensions of a partially ordered set is a comparability invariant, whereas the number of minimal weak-order extensions of a partially ordered set is not a comparability invariant.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003957 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 003957 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Curation
|type= RBID
|clé= CRIN:bertet03a
|texte= Weak-order extensions of an order
}}
| This area was generated with Dilib version V0.6.33. |  |