Pages that link to "Item:Q4264487"
From MaRDI portal
The following pages link to An Algorithm for the Modular Decomposition of Hypergraphs (Q4264487):
Displaying 14 items.
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
- Decomposition of a hypergraph by partial-edge separators (Q1566705) (← links)
- Prime 3-uniform hypergraphs (Q2053735) (← links)
- From modular decomposition trees to rooted median graphs (Q2074346) (← links)
- The complexity of modular decomposition of Boolean functions (Q2387426) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- Resolutions of convex geometries (Q2665967) (← links)
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
- 3-uniform hypergraphs: modular decomposition and realization by tournaments (Q3303522) (← links)
- (Q3534289) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
- Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
- Irreducible pairings and indecomposable tournaments (Q6580491) (← links)
