
TL;DR
This paper introduces a width measure for plane digraphs based on semi-strong minors and demonstrates that excluding a fixed semi-strong minor results in bounded width, unlike the general case.
Contribution
It defines a new width measure for plane digraphs and proves boundedness when excluding a specific semi-strong minor.
Findings
Plane digraphs excluding a fixed semi-strong minor have bounded width.
Plane digraphs in general have unbounded width.
A new branch-composition based width measure is introduced.
Abstract
A digraph is a ``semi-strong minor'' of another, , if a subdivision of can be obtained from a subdigraph of by contracting strongly-connected subdigraphs to single vertices. We will define a width measure of ``plane'' digraphs (that is, drawn in the plane) based on a kind of branch-composition, and show that for every plane digraph , all plane digraphs not containing as a semi-strong minor have bounded width, while plane digraphs in general have unbounded width.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
