18 research outputs found
31ème Journées Francophones des Langages Applicatifs
International audienc
Proceedings of the 1st International Conference on Algebras, Graphs and Ordered Sets (ALGOS 2020)
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..
Upward Planar Morphs
We prove that, given two topologically-equivalent upward planar straight-line
drawings of an -vertex directed graph , 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 morphing steps if
is a reduced planar -graph, morphing steps if is a planar
-graph, morphing steps if is a reduced upward planar graph, and
morphing steps if is a general upward planar graph. Further, we
show that morphing steps might be necessary for an upward planar
morph between two topologically-equivalent upward planar straight-line drawings
of an -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