18 research outputs found

    EUROCOMB 21 Book of extended abstracts

    Get PDF

    31ème Journées Francophones des Langages Applicatifs

    Get PDF
    International audienc

    Proceedings of the 1st International Conference on Algebras, Graphs and Ordered Sets (ALGOS 2020)

    Get PDF
    International audienceOriginating in arithmetics and logic, the theory of ordered sets is now a field of combinatorics that is intimately linked to graph theory, universal algebra and multiple-valued logic, and that has a wide range of classical applications such as formal calculus, classification, decision aid and social choice.This international conference “Algebras, graphs and ordered set” (ALGOS) brings together specialists in the theory of graphs, relational structures and ordered sets, topics that are omnipresent in artificial intelligence and in knowledge discovery, and with concrete applications in biomedical sciences, security, social networks and e-learning systems. One of the goals of this event is to provide a common ground for mathematicians and computer scientists to meet, to present their latest results, and to discuss original applications in related scientific fields. On this basis, we hope for fruitful exchanges that can motivate multidisciplinary projects.The first edition of ALgebras, Graphs and Ordered Sets (ALGOS 2020) has a particular motivation, namely, an opportunity to honour Maurice Pouzet on his 75th birthday! For this reason, we have particularly welcomed submissions in areas related to Maurice’s many scientific interests:• Lattices and ordered sets• Combinatorics and graph theory• Set theory and theory of relations• Universal algebra and multiple valued logic• Applications: formal calculus, knowledge discovery, biomedical sciences, decision aid and social choice, security, social networks, web semantics..

    36th International Symposium on Theoretical Aspects of Computer Science: STACS 2019, March 13-16, 2019, Berlin, Germany

    Get PDF

    Upward Planar Morphs

    Full text link
    We prove that, given two topologically-equivalent upward planar straight-line drawings of an nn-vertex directed graph GG, there always exists a morph between them such that all the intermediate drawings of the morph are upward planar and straight-line. Such a morph consists of O(1)O(1) morphing steps if GG is a reduced planar stst-graph, O(n)O(n) morphing steps if GG is a planar stst-graph, O(n)O(n) morphing steps if GG is a reduced upward planar graph, and O(n2)O(n^2) morphing steps if GG is a general upward planar graph. Further, we show that Ω(n)\Omega(n) morphing steps might be necessary for an upward planar morph between two topologically-equivalent upward planar straight-line drawings of an nn-vertex path.Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018) The current version is the extended on

    35th Symposium on Theoretical Aspects of Computer Science: STACS 2018, February 28-March 3, 2018, Caen, France

    Get PDF
    corecore