Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A linear-time algorithm for finding a central vertex of a chordal graph

  • Conference paper
  • First Online:
Algorithms — ESA '94 (ESA 1994)

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

Included in the following conference series:

  • 223 Accesses

Abstract

In a graph G=(V, E), the eccentricity e(v) of a vertex v is max{d(v, u)∶u ∈ V}. The center of a graph is the set of vertices with minimum eccentricity. A graph G is chordal if every cycle of length at least four has a chord. We present an algorithm which computes in linear time a central vertex of a chordal graph. The algorithm uses the metric properties of chordal graphs and Tarjan and Yannakakis linear-time test for graph chordality.

This work was partially supported by the VW-Stiftung Project No. I/69041

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.J. Chang and G.L. Nemhauser, The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Algebraic Discrete Meth. 5 (1984) 332–345.

    MathSciNet  Google Scholar 

  2. G.J. Chang, Centers of chordal graphs, Graphs and Combinatorics 7 (1991) 305–313.

    Article  MATH  MathSciNet  Google Scholar 

  3. V.D. Chepoi, Some properties of d-convexity in triangulated graphs (in Russian), Mathematical Researches (Chişinau) 87 (1986) 164–177.

    MathSciNet  Google Scholar 

  4. V.D. Chepoi, Centers of triangulated graphs (in Russian), Matematiceskie Zametki (English Transl.: Mathematical Notes) 43 (1988) 143–151.

    MathSciNet  Google Scholar 

  5. F.F. Dragan, Centers of graphs and Helly property (in Russian), PhD Thesis, Moldova State University, 1989.

    Google Scholar 

  6. P. Duchet, Classical perfect graphs: an introduction with emphasis on triangulated and interval graphs, Ann. Discrete Math. 21 (1984) 67–96.

    MATH  MathSciNet  Google Scholar 

  7. M. Farber and R.E. Jamison, Convexity in graphs and hypergraphs, SIAM J. Algebraic Discrete Meth. 7 (1986) 433–444

    MathSciNet  Google Scholar 

  8. A.M. Farley and A. Proskurowski, Computation of the center and diameter of outerplanar graphs, Discrete Appl. Math. 2 (1980) 85–191.

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  10. A. Hajnal and J. Suranyi, Über die Auflösung von Graphen in vollständige Teilgraphen, Ann. Univ. Sci. Budapest Eötvös Sect. Math. 1 (1958) 113–121.

    MathSciNet  Google Scholar 

  11. G. Handler, Minimax location of a facility in an undirected tree graph, Transportation Sci. 7 (1973) 287–293.

    MathSciNet  Google Scholar 

  12. S.M. Hedetniemi, E.J. Cockayne and S.T. Hedetniemi, Linear algorithms for finding the Jordan center and path center of a tree, Transportation Sci. 15 (1981) 98–114.

    MathSciNet  Google Scholar 

  13. R. Laskar and D. Shier, On powers and centers of chordal graphs, Discrete Appl. Math. 6 (1983) 139–147.

    Article  MathSciNet  Google Scholar 

  14. S. Olariu, A simple linear-time algorithm for computing the center of an interval graph Tech. Rept. TR-89-20 Old Dominion University, Norfolk (1989).

    Google Scholar 

  15. A. Proskurowski, Centers of 2-trees, Ann. Discrete Math. 9 (1980) 1–5.

    MATH  MathSciNet  Google Scholar 

  16. R.E. Tarjan and M. Yannakakis, Simple linear-time algorithms for test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984) 566–579.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics & Cybernetics, Moldova State University, A. Mateevici str., 60, 277009, Chişinau, Moldova

    Victor Chepoi & Feodor Dragan

Authors
  1. Victor Chepoi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feodor Dragan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chepoi, V., Dragan, F. (1994). A linear-time algorithm for finding a central vertex of a chordal graph. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049406

Download citation

  • DOI: https://doi.org/10.1007/BFb0049406

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58434-6

  • Online ISBN: 978-3-540-48794-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation