Pages that link to "Item:Q1662546"

The following pages link to Graph extremities defined by search algorithms (Q1662546):

Displaying 9 items.

• Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
• End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
• Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
• A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936) (← links)
• Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
• Graph searches and their end vertices (Q2165035) (← links)
• Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
• Moplex orderings generated by the LexDFs algorithm (Q2446863) (← links)
• Computing and listing avoidable vertices and paths (Q6185944) (← links)