In this section we show that the problem SATR can be solved in linear-time for AT-graphs A with \(\mathrm {\lambda }(A) \le ~3\); see Theorem 2. We first give a short high-level overview of the overall strategy but note that proper definitions will only be given later in the detailed description of the algorithm.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Da Lozzo
Computer Science > Data Structures and Algorithms
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Computer Science > Computational Geometry
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Computer Science > Computational Geometry
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2409.01475] The Price of Upwardness
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2408.17369] Upward Pointset Embeddings of Planar st-Graphs
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Upward Book Embeddability of st-Graphs: Complexity and Algorithms
Algorithmica, Jul 2023 A k-page upward book embedding (kUBE) of a directed acyclic graph G is a book embeddings of G on k pages with the additional requirement that the vertices appear in a topological ordering along the spine of the book. The k UBE Testing problem, which asks whether a graph admits a kUBE, was introduced in 1999 by Heath, Pemmaraju, and Trenk (SIAM J Comput 28(4), 1999).
[2308.15416] The Parametrized Complexity of the Segment Number
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Morphing Triangle Contact Representations of Triangulations
Discrete & Computational Geometry, Mar 2023 This is a preview of a remote PDF: https://link.springer.com/content/pdf/10.1007/s00454-022-00475-9.pdf Angelini, Patrizio, Chaplick, Steven, Cornelsen, Sabine, Da Lozzo, Giordano, Roselli, Vincenzo. , Discrete & Computational Geometry, 2023, pp. 1-34, DOI: 10.1007/s00454-022-00475-9
[2208.14142] Unit-length Rectangular Drawings of Graphs
arXiv:2208.14142 (cs) [Submitted on 30 Aug 2022 (v1), last revised 24 Jul 2024 (this version, v3)] View PDF Comments: Subjects: Computational Geometry (cs.CG); Data Structures and Algorithms (cs.DS) Cite as: arXiv:2208.14142 [cs.CG] (or arXiv:2208.14142v3 [cs.CG] for this version) https://doi.org/10.48550/arXiv.2208.14142 Submission history From: Fabrizio Frati [ view email] [v1] Tue, 30 Aug 2022 10:49:23 UTC (503 KB) [v2] Wed, 31 Aug 2022 07:23:00 UTC (503 KB) [v3] Wed, 24 Jul 2024 15:55:39...
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Da
Contact Da, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack