Loading...

Minimum linear arrangement of Chord graphs

Rostami, H ; Sharif University of Technology | 2008

559 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.amc.2008.04.051
  3. Publisher: 2008
  4. Abstract:
  5. The minimum linear arrangement (MINLA) is a NP-hard problem in general. But there are some classes of graphs optimally solvable in polynomial time. In this paper, we solve the minimum linear arrangement problem for a new class of graphs (Chord graphs) in polynomial time. Also, we present a closed formula for the cost of optimal arrangement. Our motivation to solve the problem for this class of graphs is its application in optimization of peer-to-peer overlay networks. © 2008 Elsevier Inc. All rights reserved
  6. Keywords:
  7. Nuclear propulsion ; Polynomial approximation ; Polynomials ; Graph layout ; Linear arrangements ; Minimum linear arrangement ; New class ; NP-hard problems ; Chord graphs ; P2P networks ; Peer-to-peer overlay networks ; Polynomial-time ; Topology awareness ; Graph theory
  8. Source: Applied Mathematics and Computation ; Volume 203, Issue 1 , 1 September , 2008 , Pages 358-367 ; 00963003 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0096300308002592