Pages that link to "Item:Q639287"

The following pages link to The longest path problem has a polynomial solution on interval graphs (Q639287):

Displaying 16 items.

• The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
• The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
• A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
• The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
• Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
• Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
• On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
• Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time (Q2840712) (← links)
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
• Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
• Contracting to a longest path in H-free graphs (Q6065420) (← links)
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
• Dendrograms, minimum spanning trees and feature selection (Q6167525) (← links)
• Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)