Skip to main content
Log in

Linear Layout of Directed Grid Graph

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

Abstract

A linear layout φ of a directed graph is a layout that provides a topological sorting of the vertices such that for any arc (u, v), φ(u) < φ(v). In this paper we discuss the linear layout of directed grid and other related architectures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bezrukov S.L., Chavez J.D., Harper L.H., Röttger M., Schroeder U.P.: The congestion of n-cube layout on a rectangular grid. Discrete Math. 213, 13–19 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Diaz J., Petit J., Serna M.: A survey of graph layout problems. Comput. Surv. 34, 313–353 (2002)

    Article  Google Scholar 

  3. Garey M.R., Johnson D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  4. Harper L.H.: Optimal numberings and isoperimetric problems on graphs. J. Comb. Theory 1, 385–393 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  5. Lai Y.L., Williams K.: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. J. Graph Theory 31(2), 75–94 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Leighton T.F.: Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo (1992)

    MATH  Google Scholar 

  7. Manuel P., Rajasingh I., Rajan B., Mercy H.: Exact wirelength of hypercube on a grid. Discrete Appl. Math. 157(7), 1486–1495 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  8. Papadimitriou H.: The NP-completeness of the bandwidth minimization problem. Computing 16, 263–270 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  9. Wong G.K., Coppersmith D.A.: A combinatorial problem related to multimodule memory organization. J. Assoc. Comput. 23, 392–401 (1974)

    Article  MathSciNet  Google Scholar 

  10. Xu J.-M.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht (2001)

    Book  MATH  Google Scholar 

  11. Cao, F., Zhu, M.M., Ding, D.: Distributed workflow scheduling under throughput and budget constraints in grid environments. In: Lecture Notes in Computer Science, pp. 62–80 (2014)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Micheal Arockiaraj.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rajasingh, I., Arockiaraj, M., Quadras, J. et al. Linear Layout of Directed Grid Graph. Math.Comput.Sci. 9, 221–227 (2015). https://doi.org/10.1007/s11786-015-0228-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-015-0228-y

Keywords

Mathematics Subject Classification

Navigation