An automatic labeling algorithm for line diagrams of ordered sets filters fixed-position candidates, then places overflow labels in faces or the exterior with binding lines, with a variant for Formal Concept Analysis.
23 Thierry Stein and Xavier Décoret
1 Pith paper cite this work, alongside 6 external citations. Polarity classification is still indexing.
1
Pith paper citing it
6
external citations · OpenAlex
fields
cs.CG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Node Labeling in Line Diagrams of Ordered Sets
An automatic labeling algorithm for line diagrams of ordered sets filters fixed-position candidates, then places overflow labels in faces or the exterior with binding lines, with a variant for Formal Concept Analysis.