✦ LIBER ✦

All-pairs-shortest-length on strongly chordal graphs

✍ Scribed by V. Balachandhran; C.Pandu Rangan

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 836 KB
Volume: 69
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00088-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unified all-pairs shortest path algorith

Unified all-pairs shortest path algorithms in the chordal hierarchy

✍ K. Han; Chandra N. Sekharan; R. Sridhar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 863 KB

The objective of this paper is to advance the view that solving the all-pairs shortest path (APSP) problem for a chordal graph G is a two-step process: the first step is determining vertex pairs at distance two (i.c., computing C') and the second step is finding the vcrtcx pairs at distance three or

On the All-Pairs-Shortest-Path Problem i

On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs

✍ R. Seidel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 318 KB

We present an algorithm, APD, that solves the distance version of the all-pairs-shortest-path problem for undirected, unweighted \(n\)-vertex graphs in time \(O(M(n) \log n)\), where \(M(n)\) denotes the time necessary to multiply two \(n \times n\) matrices of small integers (which is currently kno

A new approach to all-pairs shortest pat

A new approach to all-pairs shortest paths on real-weighted graphs

✍ Seth Pettie 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 380 KB

We present a new all-pairs shortest path algorithm that works with real-weighted graphs in the traditional comparison-addition model. It runs in O(mn + n 2 log log n) time, improving on the long-standing bound of O(mn + n 2 log n) derived from an implementation of Dijkstra's algorithm with Fibonacci

The parallel solution of domination prob

The parallel solution of domination problems on chordal and strongly chordal graphs

✍ Elias Dahlhaus; Peter Damaschke 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 975 KB

On covering all cliques of a chordal gra

On covering all cliques of a chordal graph

✍ Thomas Andreae; Carsten Flotow 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 205 KB

For a graph G = (V,E), a vertex set XC\_ V is called a clique if Ixl>~2 and the graph G [X] induced by X is a complete subgraph maximal under inclusion. We say that a vertex set T is a clique-transversal set if T N X ~ 0 for all cliques X of G, and define the clique-transversal number re(G) as the m

Solving the all-pair shortest path query

Solving the all-pair shortest path query problem on interval and circular-arc graphs

✍ Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 3 views

In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the shortest path (or its length) between any pair of vertices of the graph can be processed efficiently