Pages that link to "Item:Q1345961"

The following pages link to Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961):

Displaying 12 items.

• Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• On parallel recognition of cographs (Q627166) (← links)
• Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
• A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
• A simple linear time algorithm for cograph recognition (Q1764804) (← links)
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
• Some new classes of open distance-pattern uniform graphs (Q2248722) (← links)
• On the Letac-Massam conjecture and existence of high dimensional Bayes estimators for graphical models (Q2293718) (← links)
• A faster parallel connectivity algorithm on cographs (Q2371145) (← links)
• The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
• Efficient parallel recognition of cographs (Q2565857) (← links)