Pith. sign in

REVIEW

On Minimum Connecting Transition Sets in Graphs

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 1807.08463 v2 pith:QKDF3KWR submitted 2018-07-23 cs.DS cs.DMmath.CO

Thomas Bellitto , Benjamin Bergougnoux This is my paper · ORCID
classification cs.DScs.DMmath.CO
keywords graphproblemtransitiontransitionsableadjacentalgorithmsapproximation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A forbidden transition graph is a graph defined together with a set of permitted transitions i.e. unordered pair of adjacent edges that one may use consecutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.

Discussion (0). Continue with ORCID to comment.

Pith tools