Level Planarity Is More Difficult Than We Thought

Ignaz Rutter; Matthias Pfretzschner; Peter Stumpf; Simon D. Fink

REVIEW

Level Planarity Is More Difficult Than We Thought

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2409.01727 v1 pith:5HI75ZSJ submitted 2024-09-03 cs.DM

Simon D. Fink , Matthias Pfretzschner , Ignaz Rutter , Peter Stumpf This is my paper · ORCID

classification cs.DM

keywords levelplanaritytheyalgorithmsconsiderdifficultdrawingeither

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

We consider three simple quadratic time algorithms for the problem Level Planarity and give a level-planar instance that they either falsely report as negative or for which they output a drawing that is not level planar.

Discussion (0). Continue with ORCID to comment.

Pith tools