Pages that link to "Item:Q4289844"

The following pages link to An O(n2) Algorithm for Undirected Split Decomposition (Q4289844):

Displaying 13 items.

• Reduced clique graphs of chordal graphs (Q412263) (← links)
• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
• Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
• Practical and efficient circle graph recognition (Q472484) (← links)
• Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
• Solving some NP-complete problems using split decomposition (Q948695) (← links)
• \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
• Circle graphs and the cycle double cover conjecture (Q1025572) (← links)
• Algorithms for maximum weight induced paths (Q1603504) (← links)
• On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
• Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
• Detecting 2-joins faster (Q2376790) (← links)
• On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)