IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v47y2024i5d10.1007_s10878-024-01177-z.html
   My bibliography  Save this article

On the oriented diameter of planar triangulations

Author

Listed:
  • Debajyoti Mondal

    (University of Saskatchewan)

  • N. Parthiban

    (SRM Institute of Science and Technology)

  • Indra Rajasingh

    (Saveetha Institute of Medical and Technical Sciences)

Abstract

The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given an undirected graph G, we examine the problem of assigning directions to each edge of G such that the diameter of the resulting oriented graph is minimized. The minimum diameter over all strongly connected orientations is called the oriented diameter of G. The problem of determining the oriented diameter of a graph is known to be NP-hard, but the time-complexity question is open for planar graphs. In this paper we compute the exact value of the oriented diameter for triangular grid graphs. We then prove an n/3 lower bound and an $$n/2+O\left( \sqrt{n}\right) $$ n / 2 + O n upper bound on the oriented diameter of planar triangulations, where n is the number of vertices in G. It is known that given a planar graph G with bounded treewidth and a fixed positive integer k, one can determine in linear time whether the oriented diameter of G is at most k. We consider a weighted version of the oriented diameter problem and show it to be weakly NP-complete for planar graphs with bounded pathwidth.

Suggested Citation

  • Debajyoti Mondal & N. Parthiban & Indra Rajasingh, 2024. "On the oriented diameter of planar triangulations," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-15, July.
    • Handle: RePEc:spr:jcomop:v:47:y:2024:i:5:d:10.1007_s10878-024-01177-z
    DOI: 10.1007/s10878-024-01177-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01177-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-024-01177-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:47:y:2024:i:5:d:10.1007_s10878-024-01177-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.