Some Efficient Algorithms for Permutation Graphs (Q4290917)
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: Some Efficient Algorithms for Permutation Graphs |
scientific article; zbMATH DE number 563097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some Efficient Algorithms for Permutation Graphs |
scientific article; zbMATH DE number 563097 |
Statements
Some Efficient Algorithms for Permutation Graphs (English)
0 references
5 May 1994
0 references
connected dominating set
0 references
permutation graphs
0 references
minimum Steiner set
0 references
single-source shortest path
0 references
0 references
0.9277663
0 references
0.9108061
0 references
0.90369636
0 references
