Pages that link to "Item:Q5326888"
From MaRDI portal
The following pages link to Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity (Q5326888):
Displaying 6 items.
- Heuristics for synthesizing robust networks with a diameter constraint (Q1718143) (← links)
- A faster diameter problem algorithm for a chordal graph, with a connection to its center problem (Q2659238) (← links)
- Extremizing algebraic connectivity subject to graph theoretic constraints (Q4391459) (← links)
- Maximizing Algebraic Connectivity Over Unicyclic Graphs (Q4460635) (← links)
- Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey (Q5177046) (← links)
- Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains (Q5747711) (← links)