Skip to main content
SpringerLink
Log in
Book cover

Knowledge Processing with Interval and Soft Computing pp 167–182Cite as

Interval-Weighted Graphs and Flow Networks

  • Chapter
  • First Online:

  • 484 Accesses

Part of the book series: Advanced Information and Knowledge Processing ((AI&KP))

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832–843 (1983)

    Article  Google Scholar 

  2. Bellman, R.: On a routing problem. Quarterly of Applied Mathematics 16(1), 87–90 (1958). URL http://wisl.ece.cornell.edu/ECE794/Jan29/bellman1958.pdf

    Article  MathSciNet  Google Scholar 

  3. Borůvka, O.: On a certain minimal problem. Práce pravslé přírodověcké společnosti 3, 37-58 (1926)

    Google Scholar 

  4. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959). URL http://jmvidal.cse.sc.edu/library/dijkstra59a.pdf

    Article  MathSciNet  Google Scholar 

  5. Edmonds, J., Karp, R.: Theoretical improvements in the algorithmic efficiency for network flow problems. ACM 19, 248–264 (1972)

    MATH  Google Scholar 

  6. Fishburn, P.C.: Interval Orders and Interval Graphs: A Study of Partially Ordered Sets. Wiley, New York (1985)

    Book  Google Scholar 

  7. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton, NJ (1962)

    MATH  Google Scholar 

  8. Goodrich, M., Tamassia, R.: Algorithm Design: Foundations, Analysis, and Internet Examples. Wiley, New York (2002)

    MATH  Google Scholar 

  9. Hu, P., Hu, C.: Fuzzy partial-order relations for intervals and interval weighted graphs. In: Proceedings of Foundations of Computational Intelligence, pp. 120-127 IEEE, New York (2007)

    Google Scholar 

  10. Krokhin, A., Jeavons, P., Jonsson, P.: Reasoning about temporal relations: The tractable subalgebras of Allen’s interval algebra. Journal of the Association for Computing Machinery 50(5), 591–640 (2003)

    Article  MathSciNet  Google Scholar 

  11. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7(1), 48–50 (1956)

    Article  MathSciNet  Google Scholar 

  12. Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Central Arkansas, 201 Donaghey Avenue, Conway, AR 72035-0001, USA

    Chenyi Hu & Ping Hu

Authors
  1. Chenyi Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ping Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chenyi Hu .

Editor information

Editors and Affiliations

  1. Dept. Computer Science, University of Texas, W. University Ave. 500, El Paso, 79968, USA

    Vladik Kreinovich

  2. Dept. Computer &, University of Houston-Downtown, Main St. 1, Houston, 77002-1014, USA

    Andre Korvin

  3. Dept. Mathematics, University of Louisiana, Lafayette , Lafayette, 70504-1010, USA

    R. Baker Kearfott

  4. Computer Science Department, University of Central Arkansas, Conway, Arkansas, USA

    Chenyi Hu

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag London

About this chapter

Cite this chapter

Hu, C., Hu, P. (2008). Interval-Weighted Graphs and Flow Networks. In: Kreinovich, V., Korvin, A., Baker Kearfott, R., Hu, C. (eds) Knowledge Processing with Interval and Soft Computing. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-1-84800-326-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-84800-326-2_8

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84800-325-5

  • Online ISBN: 978-1-84800-326-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation