A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(96)00092-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091437869 / rank | |||
Normal rank | |||
Revision as of 19:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for finding all hinge vertices of a permutation graph |
scientific article |
Statements
A linear time algorithm for finding all hinge vertices of a permutation graph (English)
0 references
27 February 1997
0 references
Algorithms
0 references
Permutation graphs
0 references
Hinge vertices
0 references
Shortest paths
0 references
Neighborhood
0 references
