The space required to store the adjacency matrix of a graph with n vertices is

Related MCQs

• A complete graph is a graph in which each pair of vertices is adjacent
• A decomposition can be illustrated in the form of a directed graph with nodes corresponding to tasks and edges indicating that the result of one task is required for processing the next. Such graph is called as
• The n × n matrix is partitioned among n processors, with each processor storing complete ___ of the matrix.
• Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)
• Time Complexity of DFS is? (V – number of vertices, E – number of edges)
• In Dijkstra's all pair shortest path each process compute the single-source shortest paths for all vertices assigned to it in SOURCE PARTITIONED FORMULATION
• The n × n matrix is partitioned among n2 processors such that each processor owns a _____ element.
• how many basic communication operations are used in matrix vector multiplication
• In DNS algorithm of matrix multiplication it used
• The processors compute ______ product of the vector element and the loval matrix