A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472)
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 6682553
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs |
scientific article; zbMATH DE number 6682553 |
Statements
A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (English)
0 references
9 February 2017
0 references
2-fixed-endpoint Hamiltonian path problem
0 references
forward degree sequence
0 references
Hamiltonian path
0 references
interval representation
0 references
normal vertex ordering
0 references
0 references
0 references
0 references
0 references
0.9445831
0 references
0.94129634
0 references
0.9395072
0 references
0.9344707
0 references
0.9332025
0 references
0.91675794
0 references
0.90182763
0 references
0.8922313
0 references
