Pages that link to "Item:Q915465"

The following pages link to An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals (Q915465):

Displaying 18 items.

• Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
• An efficient parallel algorithm for scheduling interval ordered tasks (Q652455) (← links)
• Simple linear time recognition of unit interval graphs (Q672408) (← links)
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
• Cyclability in graph classes (Q833007) (← links)
• Linear algorithm for optimal path cover problem on interval graphs (Q911770) (← links)
• A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
• An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs (Q1273613) (← links)
• 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
• Toughness, hamiltonicity and split graphs (Q1916113) (← links)
• The Steiner cycle and path cover problem on interval graphs (Q2075469) (← links)
• The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
• Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
• Connected proper interval graphs and the guard problem in spiral polygons (extended abstract) (Q6567668) (← links)