Solving the all-pairs-shortest-length problem on chordal bipartite graphs
From MaRDI portal
Publication:294620
DOI10.1016/S0020-0190(98)00195-1zbMATH Open1339.05205OpenAlexW2135039026MaRDI QIDQ294620FDOQ294620
Authors: Chin-Wen Ho, Jou-Ming Chang 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001951?np=y
Recommendations
- All-pairs-shortest-length on strongly chordal graphs
- All pairs shortest paths for graphs with small integer length edges
- Unified all-pairs shortest path algorithms in the chordal hierarchy
- scientific article; zbMATH DE number 913360
- Solving the shortest-paths problem on bipartite permutation graphs efficiently
Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Paths and cycles (05C38)
Cites Work
- Incidence matrices and interval graphs
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Matrix multiplication via arithmetic progressions
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- Doubly lexical ordering of dense 0--1 matrices
- Three Partition Refinement Algorithms
- Characterizations of strongly chordal graphs
- All-pairs-shortest-length on strongly chordal graphs
- Totally-Balanced and Greedy Matrices
- Doubly Lexical Orderings of Matrices
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- Solving the shortest-paths problem on bipartite permutation graphs efficiently
Cited In (5)
- Computing the all-pairs longest chains in the plane
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs
- An all-pairs shortest path algorithm for bipartite graphs
- Some optimization problems on weak-bisplit graphs
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
Uses Software
This page was built for publication: Solving the all-pairs-shortest-length problem on chordal bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294620)
