Pages that link to "Item:Q1198051"
From MaRDI portal
The following pages link to Finding good approximate vertex and edge partitions is NP-hard (Q1198051):
Displayed 13 items.
- Parallel multilevel algorithms for hypergraph partitioning (Q436760) (← links)
- An exact algorithm for solving the vertex separator problem (Q628743) (← links)
- A note on edge-based graph partitioning and its linear algebraic structure (Q662140) (← links)
- Parameterized graph separation problems (Q820151) (← links)
- On the complexity of finding balanced oneway cuts (Q1014383) (← links)
- Balanced cut approximation in random geometric graphs (Q1029344) (← links)
- Using domain decomposition to find graph bisectors (Q1371661) (← links)
- An experimental evaluation of local search heuristics for graph partitioning (Q1382773) (← links)
- Parallel adaptive subspace correction schemes with applications to elasticity (Q1574336) (← links)
- The restrictive \(H\)-coloring problem (Q1764813) (← links)
- On cutting a few vertices from a graph (Q1811082) (← links)
- Transport optimization on complex networks (Q3624815) (← links)
- IMPROVED EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS (Q4918284) (← links)