1994/11/18 by A. Belkasri, Belkasri, A., M. Hamade +1
Computer Science · Engineering · Mathematics · #Algebraic Geometry (math.AG) #Computational Geometry and Mesh Generation #FOS: Mathematics #Mathematics and Applications #Spatial Cognition and Navigation #alg-geom #math.AG
paper · pdf · doi:10.48550/arxiv.alg-geom/9411013
20 pages, LaTeX, macro epsf.sty
arxiv created 1994/11/18 · openalex publication_date 1994/11/18 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of simplices and multiplices). A mathematical algorithm is given for the case of a comparability graph which has only non limit sub-graphs.