Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs (Q1195486)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs |
scientific article; zbMATH DE number 69904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs |
scientific article; zbMATH DE number 69904 |
Statements
Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs (English)
0 references
29 November 1992
0 references
efficient algorithms
0 references
clique independent set
0 references
overlap graph
0 references
weight independent set
0 references
permutation graphs
0 references
