Pages that link to "Item:Q5890507"

The following pages link to Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs (Q5890507):

Displaying 10 items.

• Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
• On the geodetic iteration number of distance-hereditary graphs (Q898096) (← links)
• Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
• Computing the hull number in toll convexity (Q2159554) (← links)
• The geodetic hull number is hard for chordal graphs (Q2413187) (← links)
• Extended dualization: application to maximal pattern mining (Q2634673) (← links)
• Two classes of graphs in which some problems related to convexity are efficiently solvable (Q4554573) (← links)
• The Geodetic Hull Number is Hard for Chordal Graphs (Q4604645) (← links)
• A polynomial time algorithm for geodetic hull number for complementary prisms (Q5037202) (← links)
• Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)