Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 60, 1996 - Issue 3-4
Submit an article Journal homepage
98
Views
20
CrossRef citations to date
0
Altmetric
Original Articles

A sequential algorithm for finding a maximum weight K-independent set on interval graphs

Madhumangal Pal Department of Mathematics, Indian Institute of Technology, Kharagpur, 721 302, India
&
G. P. Bhattacharjee Department of Mathematics, Indian Institute of Technology, Kharagpur, 721 302, India
Pages 205-214 | Received 10 Sep 1995, Published online: 19 Mar 2007

Citations (20)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (3)

Satyabrata Paul, Madhumangal Pal & Anita Pal. (2016) A linear time algorithm to compute square of interval graphs and their colouring. AKCE International Journal of Graphs and Combinatorics 13:1, pages 54-64.
Read now
Anita Saha & Madhumangal Pal. (2003) Maximum weight k-independent set problem on permutation graphs . International Journal of Computer Mathematics 80:12, pages 1477-1487.
Read now
Marinmoy Hota, Madhumangal Pal & Tapan K. Pal. (1999) An efficient algorithm to generate all maximal independent sets on trapezoid graphs. International Journal of Computer Mathematics 70:4, pages 587-599.
Read now

Articles from other publishers (17)

Ana Klobučar & Robert Manger. (2021) Solving Robust Weighted Independent Set Problems on Trees and under Interval Uncertainty. Symmetry 13:12, pages 2259.
Crossref
Ana Klobučar & Robert Manger. (2020) Solving Robust Variants of the Maximum Weighted Independent Set Problem on Trees. Mathematics 8:2, pages 285.
Crossref
Madhumangal Pal. 2020. Handbook of Research on Advanced Applications of Graph Theory in Modern Society. Handbook of Research on Advanced Applications of Graph Theory in Modern Society 24 65 .
Sambhu Charan Barman, Madhumangal Pal & Sukumar Mondal. (2019) An optimal algorithm to find minimum k-hop dominating set of interval graphs. Discrete Mathematics, Algorithms and Applications 11:02, pages 1950016.
Crossref
Sk. Amanathulla & Madhumangal Pal. (2018) Surjective L (2, 1)-labeling of cycles and circular-arc graphs. Journal of Intelligent & Fuzzy Systems 35:1, pages 739-748.
Crossref
Satyabrata Paul, Madhumangal Pal & Anita Pal. (2014) L(2,1)-labeling of interval graphs. Journal of Applied Mathematics and Computing 49:1-2, pages 419-432.
Crossref
Adam Kasperski & Paweł Zieliński. (2014) Complexity of the robust weighted independent set problems on interval graphs. Optimization Letters 9:3, pages 427-436.
Crossref
Fabrice Talla Nobibon & Roel Leus. (2012) Robust maximum weighted independent-set problems on interval graphs. Optimization Letters 8:1, pages 227-235.
Crossref
Dvir Shabtay. (2012) The just-in-time scheduling problem in a flow-shop scheduling system. European Journal of Operational Research 216:3, pages 521-532.
Crossref
Dvir Shabtay & Yaron Bensoussan. (2010) Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems. Journal of Scheduling 15:1, pages 39-47.
Crossref
Dvir Shabtay & George Steiner. 2012. Just-in-Time Systems. Just-in-Time Systems 3 20 .
Yaron Leyvand, Dvir Shabtay, George Steiner & Liron Yedidsion. (2009) Just-in-time scheduling with controllable processing times on parallel machines. Journal of Combinatorial Optimization 19:3, pages 347-368.
Crossref
Mikhail Y. Kovalyov, C.T. Ng & T.C. Edwin Cheng. (2007) Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research 178:2, pages 331-342.
Crossref
Swagata Mandal & Madhumangal Pal. (2006) Maximum weight independent set of circular-arc graph and its application. Journal of Applied Mathematics and Computing 22:3, pages 161-174.
Crossref
Fabien Coulon & Mathieu Raffinot. (2006) Fast algorithms for identifying maximal common connected sets of interval graphs. Discrete Applied Mathematics 154:12, pages 1709-1721.
Crossref
Anita Saha, Madhumangal Pal & Tapan K. Pal. (2005) An efficient pram algorithm for maximum-weight independent set on permutation graphs. Journal of Applied Mathematics and Computing 19:1-2, pages 77-92.
Crossref
Fabrice Talla Nobibon & Roel Leus. (2011) Robust Maximum Weighted Independent-Set Problems on Interval Graphs. SSRN Electronic Journal.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.