Pages that link to "Item:Q3968949"

The following pages link to Isomorphism Testing in Hookup Classes (Q3968949):

Displaying 11 items.

• The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
• Isomorphism testing of k-trees is in NC, for fixed k (Q910212) (← links)
• Complement reducible graphs (Q1153105) (← links)
• The isomorphism problem for classes of graphs closed under contraction (Q1175965) (← links)
• A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
• On the structure of graphs with few \(P_4\)s (Q1392556) (← links)
• Isomorphism of chordal (6, 3) graphs (Q1893148) (← links)
• Graph reconstruction from unlabeled edge lengths (Q2039322) (← links)
• The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953) (← links)
• A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees (Q3773922) (← links)
• The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)