Skip to Main Content
 

Global Search Box

 
 
 

ETD Abstract Container

Abstract Header

EXPERIMENTS ON CHORDAL GRAPH HELLIFICATION

Alzaidi, Esraa Raheem

Abstract Details

2017, MS, Kent State University, College of Arts and Sciences / Department of Computer Science.
Helly graphs are very important in understanding the properties of any hyperbolic network. Hyperbolicity is present in many real-world networks originating in computer science, biology, physics and social sciences. Any hyperbolic graph is isometrically embeddable into a Helly graph through a process called graph hellification. Unfortunately, hellification of an arbitrary graph may result in an exponential growth of the original graph. We investigate an interesting question whether a Chordal graph (a graph having only small induced cycles, i.e. has no chordless cycles of length greater than 3) can be efficiently hellified and with small number of added new vertices.
Feodor Dragan (Advisor)
Gokarna Sharma (Committee Member)
Xiang Lian (Committee Member)
35 p.

Recommended Citations

Citations

  • Alzaidi, E. R. (2017). EXPERIMENTS ON CHORDAL GRAPH HELLIFICATION [Master's thesis, Kent State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=kent1494430064980414

    APA Style (7th edition)

  • Alzaidi, Esraa. EXPERIMENTS ON CHORDAL GRAPH HELLIFICATION. 2017. Kent State University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=kent1494430064980414.

    MLA Style (8th edition)

  • Alzaidi, Esraa. "EXPERIMENTS ON CHORDAL GRAPH HELLIFICATION." Master's thesis, Kent State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1494430064980414

    Chicago Manual of Style (17th edition)