Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2002: Algorithms and Computation pp 428–440Cite as

Minimum Edge Ranking Spanning Trees of Threshold Graphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2518))

Abstract

Given a graph G, the minimum edge ranking spanning tree problem (MERST) is to find a spanning tree of G whose edge ranking is minimum. However, this problem is known to be NP-hard for general graphs. In this paper, we show that the problem MERST has a polynomial time algorithm for threshold graphs, which have useful applications in practice. The result is also significant in the sense that this is a first non-trivial graph class for which the problem MERST is found to be polynomially solvable.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. L. Bodlaender, J. S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Müller and Zs. Tuza, Ranking of graphs, SIAM J. Discrete Mathematics, 11,1 (1998), 168–181.

    Article  MATH  Google Scholar 

  2. V. Chvátal and P. L. Hammer, Aggregation of inequalities in integer programming, Annals of Discrete Mathematics, 1 (1977), 145–162.

    Article  Google Scholar 

  3. P. de la Torre, R. Greenlaw and A. A. Schäffer, Optimal edge ranking of trees in polynomial time, Algorithmica, 13 (1995), 592–618.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.

    MATH  Google Scholar 

  5. P. L. Hammer, T. Ibaraki and B. Simeone, Threshold sequences, SIAM Journal on Algebraic and Discrete Mathematics, 2, 39–49, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  6. T. Ibaraki and T. Kameda, On the optimal nesting order for computing N-relational joins, ACM Transactions on Database Systems, 9,3 (1984), 482–502.

    Article  MathSciNet  Google Scholar 

  7. A. V. Iyer, H. D. Ratliff and G. Vijayan, On an edge-ranking problem of trees and graphs, Discrete Applied Mathematics, 30 (1991), 43–52.

    Article  MATH  MathSciNet  Google Scholar 

  8. T. W. Lam and F. L. Yue, Edge ranking of graphs is hard, Discrete Applied Mathematics, 85 (1998), 71–86.

    Article  MATH  MathSciNet  Google Scholar 

  9. T. W. Lam and F. L. Yue, Optimal edge ranking of trees in linear time, Algorithmica, 30 (2001), 12–33.

    Article  MATH  MathSciNet  Google Scholar 

  10. K. Makino, Y. Uno and T. Ibaraki, On minimum edge ranking spanning trees, Journal of Algorithms, 38 (2001), 411–437.

    Article  MATH  MathSciNet  Google Scholar 

  11. Y. Uno and T. Ibaraki, Complexity of the optimum join order problem in relational databases, IEICE Transactions, E74,7 (1991), 2067–2075.

    Google Scholar 

  12. X. Zhou, M. A. Kashem and T. Nishizeki, Generalized edge-rankings of trees, IEICE Transactions, E81-A,2 (1998), 310–319.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Systems Science, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka, 560-8531, Japan

    Kazuhisa Makino

  2. Department of Mathematics and Information Sciences, College of Integrated Arts and Sciences, Osaka Prefecture University, Sakai, 599-8531, Japan

    Yushi Uno

  3. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, 606-8501, Japan

    Toshihide Ibaraki

Authors
  1. Kazuhisa Makino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yushi Uno
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Toshihide Ibaraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Prosenjit Bose  & Pat Morin  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Makino, K., Uno, Y., Ibaraki, T. (2002). Minimum Edge Ranking Spanning Trees of Threshold Graphs. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

  • Online ISBN: 978-3-540-36136-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation