An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs (Q5931033)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1592714
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs |
scientific article; zbMATH DE number 1592714 |
Statements
An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs (English)
0 references
26 June 2001
0 references
trapezoid graph
0 references
independent set
0 references
path
0 references
network flow problem
0 references
combinatorial problems
0 references
design of algorithms
0 references
analysis of algorithms
0 references
directed acyclic graph
0 references
sequential algorithm
0 references
maximum weight \(k\)-independent set problem
0 references
weighted trapezoid graphs
0 references
0.8617637753486633
0 references
0.8031623959541321
0 references
0.8028472661972046
0 references
0.7760610580444336
0 references
