Pages that link to "Item:Q4327827"
From MaRDI portal
The following pages link to Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs (Q4327827):
Displaying 4 items.
- Bipartite permutation graphs with application to the minimum buffer size problem (Q678867) (← links)
- A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
- Graph indexing for spatial data traversal in road map databases (Q1592582) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)