The following pages link to (Q3347934):
Displaying 7 items.
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control (Q506453) (← links)
- A linear time algorithm for graph partition problems (Q1198016) (← links)
- Path optimization for graph partitioning problems (Q1276954) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Computing the isoperimetric number of a graph (Q1905161) (← links)
- Combining simulated annealing with local search heuristics (Q1919834) (← links)
- Isoperimetric numbers of graphs (Q2639872) (← links)
