Pith. sign in

REVIEW 1 cited by

An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.09642 v2 pith:J6RTS4XN submitted 2020-03-21 cs.DM cs.SYeess.SY

An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs

classification cs.DM cs.SYeess.SY
keywords lineardifferentgraphslayoutsclientlayoutonlineserver
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We present a prototype online system to automate the procedure of computing different types of linear layouts of graphs under different user-specific constraints. Currently, four different types of linear layouts are supported: stack, queue, rique and deque, as well as, any mixture of them. 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Weighted Book Thickness

    cs.CG 2026-07 accept novelty 7.0

    Weighted book thickness can require strictly more pages than classical book thickness, already for a 10-vertex planar graph and for a 2-tree, but equals the 2-page value for all pathwidth-2 graphs.