A sequential algorithm for finding a maximum weightK-independent set on interval graphs
- 1 January 1996
- journal article
- research article
- Published by Taylor & Francis Ltd in International Journal of Computer Mathematics
- Vol. 60 (3-4), 205-214
- https://doi.org/10.1080/00207169608804486
Abstract
In this paper an O(kn√logc+γ) time algorithm is presented to solve the maximum weight k-independent set problem on an interval graph with n vertices and non-negative integer weights, where c is the weight of the longest path of the interval graph and γ is the total size of all maximal cliques, given its interval representation. If the intervals are not sorted then considering the time for sorting the time complexity is of O(nlogn+kn √logc+γ). Using this algorithm the maximum weight 2-independent set problem for an interval graph with n vertices can be solved in O(n √logc + γ) time. The best known previous algorithm for 2-independent set problem requires O(n 2) time.Keywords
This publication has 11 references indexed in Scilit:
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphsInformation Processing Letters, 1992
- An Optimal Algorithm for the Maximum Two-Chain ProblemSIAM Journal on Discrete Mathematics, 1992
- Solving the single step graph searching problem by solving the maximum two-independent set problemInformation Processing Letters, 1991
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- A new approach to topological via minimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- The maximum k-colorable subgraph problem for chordal graphsInformation Processing Letters, 1987
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964