A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph

Keyphrases

• Heuristic Algorithm 100%
• Numerical Results 50%
• Laplacian Matrix 50%
• Spectral Graph 50%
• Matrix Equation 50%
• Benchmark Test Problems 50%
• Sparse Matrix 50%

Mathematics

• Heuristic Algorithm 100%
• Test Problem 50%
• Sparse Matrix 50%
• Laplacian Matrix 50%
• Matrix Equation 50%