2 Calculating Successor Matrix for General Graphs
نویسنده
چکیده
1. An O(mm(n) log(n)) = O(nω+ ) algorithm which finds the shortest distance matrix for a graph G by recursively finding the shortest distance matrix for the graph G2. 2. The problem of determining the successor matrix for tripartite graphs. 3. O(nω) time algorithm for finding successor matrix in in a simple tripartite graph when there is a unique successor for any 2 vertices. 4. An O(mm(n) log(n)) = O(nω+ ) randomized algorithm for the case when there are an unknown number of successor vertices.
منابع مشابه
Compact representation of Web graphs with extended functionality
The representation of large subsets of the World Wide Web in the form of a directed graph has been extensively used to analyze structure, behavior, and evolution of those so-called Web graphs. However, interesting Web graphs are very large and their classical representations do not fit into the main memory of typical computers, whereas the required graph algorithms perform inefficiently on seco...
متن کاملPermanents of Circulants: a Transfer Matrix Approach (expanded Version) *
Calculating the permanent of a (0, 1) matrix is a #P -complete problem but there are some classes of structuredmatrices for which the permanent is calculable in polynomial time. The most well-known example is the fixedjump (0, 1) circulant matrix which, using algebraic techniques, was shown by Minc to satisfy a constant-coefficient fixed-order recurrence relation. In this note we show how, by i...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملSuccessor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs
We show that the model-checking problem for successorinvariant first-order logic is fixed-parameter tractable on graphs with excluded topological subgraphs when parameterised by both the size of the input formula and the size of the exluded topological subgraph. Furthermore, we show that model-checking for order-invariant first-order logic is tractable on coloured posets of bounded width, param...
متن کاملRoman Domination
In his article published in 1999, Ian Stewart discussed a strategy of Emperor Constantine for defending the Roman Empire. Motivated by this article, Cockayne et al.(2004) introduced the notion of Roman domination in graphs. Let G = (V,E) be a graph. A Roman dominating function of G is a function f : V → {0, 1, 2} such that every vertex v for which f(v) = 0 has a neighbor u with f(u) = 2. The we...
متن کامل