Pages that link to "Item:Q5677525"

The following pages link to Cutsets and partitions of hypergraphs (Q5677525):

Displaying 19 items.

• Finding minimum 3-way cuts in hypergraphs (Q765477) (← links)
• LS sets as cohesive subsets of graphs and hypergraphs (Q800386) (← links)
• Minimum degree orderings (Q848936) (← links)
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
• A note on hypergraph decomposition based on extended minimal sets (Q1124611) (← links)
• A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy (Q1232425) (← links)
• Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
• Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
• On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
• On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
• Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
• Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
• Formalising and detecting community structures in real world complex networks (Q2661873) (← links)
• Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
• Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm (Q5075796) (← links)
• Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (Q5140705) (← links)
• Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
• Comparing the principal eigenvector of a hypergraph and its shadows (Q6161128) (← links)
• Hypergraph analysis based on a compatible tensor product structure (Q6185980) (← links)