An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs
share
We present a prototype online system to automate the procedure of computing different types of linear layouts of graphs under different user-specific constraints. The system consists of two main components; the client and the server sides. The client side is built upon an easy-to-use editor, which supports basic interaction with graphs, enriched with several additional features to allow the user to define and further constraint the linear layout to be computed. The server side, which is available to multiple clients through a well-documented API, is responsible for the actual computation of the linear layout. Its algorithmic core is an extension of a SAT formulation that is known to be robust enough to solve non-trivial instances in reasonable amount of time. However, it has also several known limitations and potential improvements that we address in this work (e.g., limited applicability to a particular type of linear layouts, no support for additional constraints, limited extendability e.t.c.). As a proof of concept, we present our findings for a sketch of a proof of an important result in the field that was proposed by Yannakakis back in 1986 (whose details, however, have not been published so far).
READ FULL TEXT