Some Efficient Algorithms for Permutation Graphs (Q4290917): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jagm.1994.1021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012809896 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:55, 19 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
