Volume 13, Issue 2 (8-2016)                   jor 2016, 13(2): 101-111 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

A Linear Algorithm for Finding Core of Weighted Interval Trees. jor 2016; 13 (2) :101-111
URL: http://jamlu.liau.ac.ir/article-1-1412-en.html
Abstract:   (3773 Views)

In this paper we consider the problem of finding a core of weighted interval trees.  A core of an interval graph is a path contains some intervals of graph so that the sum of distances from all intervals to this path is minimized. We show that intervals on core of a tree should be maximal, then a linear time algorithm is presented to find the core of interval trees

Full-Text [PDF 639 kb]   (1233 Downloads)    
Type of Study: Research | Subject: Special
Received: 2016/12/24 | Accepted: 2016/12/24 | Published: 2016/12/24

Add your comments about this article : Your username or Email:
CAPTCHA

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.