Pages that link to "Item:Q5902515"

The following pages link to Graph-Theoretic Concepts in Computer Science (Q5902515):

Displaying 18 items.

• Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs (Q324752) (← links)
• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
• Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
• An improvement on the complexity of factoring read-once Boolean functions (Q944714) (← links)
• A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386) (← links)
• Characterizing and computing minimal cograph completions (Q972335) (← links)
• Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
• Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
• A simple linear time algorithm for cograph recognition (Q1764804) (← links)
• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
• Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
• Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
• Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
• Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
• Efficient parallel recognition of cographs (Q2565857) (← links)
• On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)