A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 983271
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for finding all hinge vertices of a permutation graph |
scientific article; zbMATH DE number 983271 |
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
0 references
0.92273235
0 references
0.8775392
0 references
0.8758137
0 references
0.87259674
0 references
0.86738527
0 references
0.86199224
0 references
0.85844535
0 references
