Pages that link to "Item:Q671396"

The following pages link to A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396):

Displaying 8 items.

• The recognition of geodetically connected graphs (Q293190) (← links)
• An efficient algorithm for finding all hinge vertices on trapezoid graphs (Q1405798) (← links)
• Recognizing hinge-free line graphs and total graphs (Q1596464) (← links)
• Erratum and addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph'' (Q1944158) (← links)
• Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs (Q2030268) (← links)
• Evolution of cooperation for multiple mutant configurations on all regular graphs with \(N \leq 14\) players (Q2221250) (← links)
• The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs (Q2731130) (← links)
• An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762) (← links)