Pages that link to "Item:Q3752416"
From MaRDI portal
The following pages link to Solution of one problem of optimal partition of the vertex set of a hypergraph (Q3752416):
Displaying 10 items.
- The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications (Q678869) (← links)
- On partitioning of hypergraphs (Q879389) (← links)
- NP-hard and linear variants of hypergraph partitioning (Q1041217) (← links)
- A note on hypergraph decomposition based on extended minimal sets (Q1124611) (← links)
- A note on formulations for the \(A\)-partition problem on hypergraphs (Q1276964) (← links)
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis (Q1276973) (← links)
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- An efficient algorithm for judicious partition of hypergraphs (Q1708643) (← links)
- A fast hypergraph min-cut algorithm for circuit partitioning (Q2734604) (← links)
- Special cluster on operations research in electrical and computer engineering: using eigenvectors to partition circuits (Q2892287) (← links)
