Pages that link to "Item:Q2517792"

The following pages link to Maximum algebraic connectivity augmentation is NP-hard (Q2517792):

Displaying 17 items.

• Experiments with two heuristic algorithms for the maximum algebraic connectivity augmentation problem (Q510905) (← links)
• Note on von Neumann and Rényi entropies of a graph (Q513257) (← links)
• On algebraic connectivity augmentation (Q550607) (← links)
• Augmenting the algebraic connectivity for certain families of graphs (Q1634763) (← links)
• Heuristics for synthesizing robust networks with a diameter constraint (Q1718143) (← links)
• Optimizing network robustness by edge rewiring: a general framework (Q1741288) (← links)
• Algorithms for synthesizing mechanical systems with maximal natural frequencies (Q1926188) (← links)
• Improving connectivity of compromised digital networks via algebraic connectivity maximisation (Q2031111) (← links)
• An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
• Maximizing algebraic connectivity for certain families of graphs (Q2261533) (← links)
• The algebraic connectivity of graphs with given circumference (Q2632019) (← links)
• Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity (Q5326888) (← links)
• (Q5874542) (← links)
• Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems (Q6106026) (← links)
• Minimizing the effective graph resistance by adding links is NP-hard (Q6556184) (← links)
• Effects on the algebraic connectivity of weighted graphs under edge rotations (Q6635258) (← links)
• Attainable bounds for algebraic connectivity and maximally connected regular graphs (Q6642505) (← links)