Pages that link to "Item:Q1764805"

The following pages link to Linear-time modular decomposition of directed graphs (Q1764805):

Displaying 18 items.

• Decomposition tree of a lexicographic product of binary structures (Q409340) (← links)
• A distance measure for large graphs based on prime graphs (Q531270) (← links)
• Kernels for feedback arc set in tournaments (Q657916) (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
• Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
• Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
• A graph isomorphism condition and equivalence of reaction systems (Q1682860) (← links)
• Reconstructing gene trees from Fitch's xenology relation (Q1789081) (← links)
• The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations (Q2014353) (← links)
• Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees (Q2192103) (← links)
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
• Tournaments without acyclic interval. (Q2573972) (← links)
• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
• Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071) (← links)
• SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES (Q3087001) (← links)
• Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
• Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266) (← links)
• Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)