Some Efficient Algorithms for Permutation Graphs (Q4290917): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 16:11, 5 March 2024
scientific article; zbMATH DE number 563097
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
