An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs

Authors:
Mrinmoy Hota;Madhumangal Pal;Tapan K. Pal
Affiliations:
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721 102, India;Department of Mathematics, Midnapore College, Midnapore 721 101, India;Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore 721 102, India
Venue:
Computational Optimization and Applications
Year:
2001

Citing 11
Cited 4

The maximum k-colorable subgraph problem for chordal graphs

Information Processing Letters
Trapezoid graphs and their coloring

Discrete Applied Mathematics
Faster algorithms for the shortest path problem

Journal of the ACM (JACM)
An optimal algorithm for the maximum two-chain problem

SIAM Journal on Discrete Mathematics
An efficient algorithm for finding a maximum weight 2-independent set on interval graphs

Information Processing Letters
Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs

Information Processing Letters
On the 2-chain subgraph cover and related problems

Journal of Algorithms
On the structure of trapezoid graphs

Discrete Applied Mathematics
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs

Computational Optimization and Applications
Selection of programme slots of television channels for giving advertisement: A graph theoretic approach

Information Sciences: an International Journal
Packing vertices and edges in random regular graphs

Random Structures & Algorithms
Efficient algorithm for the vertex connectivity of trapezoid graphs

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The maximum weight k-independent set problem has applications in many practical problems like k-machines job scheduling problem, k-colourable subgraph problem, VLSI design layout and routing problem. Based on DAG (Directed Acyclic Graph) approach, an O(kn2) time sequential algorithm is designed in this paper to solve the maximum weight k-independent set problem on weighted trapezoid graphs. The weights considered here are all non-negative and associated with each of the n vertices of the graph.