Approximating layout problems on random geometric graphs
From MaRDI portal
Recommendations
Cited in
(28)- Balanced cut approximation in random geometric graphs
- Expander properties and the cover time of random intersection graphs
- Consistency of modularity clustering on random geometric graphs
- Optimal linear arrangements using betweenness variables
- Layout of random circulant graphs
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Minimum bisection is NP-hard on unit disk graphs
- Optimal Cheeger cuts and bisections of random geometric graphs
- Convergence theorems for some layout measures on random lattice and random geometric graphs
- Lower bounds for the minimum linear arrangement of a graph
- On cutwidth parameterized by vertex cover
- Computing the cutwidth of bipartite permutation graphs in linear time
- Variable neighborhood search for the vertex separation problem
- Packing of (0, 1)-matrices
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
- On a binary distance model for the minimum linear arrangement problem
- On cutwidth parameterized by vertex cover
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
- Balanced Cut Approximation in Random Geometric Graphs
- Experiments on the minimum linear arrangement problem
- Hamilton cycles in random geometric graphs
- Bipartite graphs of small readability
- Approximating layout problems on random graphs
- Graph bandwidth of weighted caterpillars
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
- Large independent sets in general random intersection graphs
- Communication tree problems
This page was built for publication: Approximating layout problems on random geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2731603)
