Pages that link to "Item:Q2710758"

The following pages link to A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (Q2710758):

Displaying 16 items.

• A linear time algorithm to compute square of interval graphs and their colouring (Q322053) (← links)
• The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
• \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
• The off-line group seat reservation problem (Q613435) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• Maximum weight independent set of circular-arc graph and its application (Q861467) (← links)
• Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
• Complexity of the robust weighted independent set problems on interval graphs (Q2018858) (← links)
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
• Robust maximum weighted independent-set problems on interval graphs (Q2439511) (← links)
• Fast algorithms for identifying maximal common connected sets of interval graphs (Q2499592) (← links)
• An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
• An efficient algorithm to generate all maximal independent sets on trapezoid graphs (Q4240618) (← links)
• Maximum weight<i>k</i>-independent set problem on permutation graphs (Q4467342) (← links)
• An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)