Pages that link to "Item:Q2731603"
From MaRDI portal
The following pages link to Approximating Layout Problems on Random Geometric Graphs (Q2731603):
Displayed 25 items.
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Hamilton cycles in random geometric graphs (Q549867) (← links)
- Graph bandwidth of weighted caterpillars (Q860873) (← links)
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483) (← links)
- Large independent sets in general random intersection graphs (Q952443) (← links)
- Communication tree problems (Q995575) (← links)
- Balanced cut approximation in random geometric graphs (Q1029344) (← links)
- Expander properties and the cover time of random intersection graphs (Q1034533) (← links)
- Consistency of modularity clustering on random geometric graphs (Q1617118) (← links)
- Optimal linear arrangements using betweenness variables (Q1762457) (← links)
- Layout of random circulant graphs (Q1794318) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Minimum bisection is NP-hard on unit disk graphs (Q2407090) (← links)
- Optimal Cheeger cuts and bisections of random geometric graphs (Q2657914) (← links)
- (Q2861498) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614) (← links)
- Packing of (0, 1)-matrices (Q3423133) (← links)
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs (Q3522870) (← links)
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs (Q5302057) (← links)
- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs (Q5321706) (← links)
- Experiments on the minimum linear arrangement problem (Q5463444) (← links)
- Bipartite graphs of small readability (Q5919328) (← links)