Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 05C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6594021
@@ Property / zbMATH DE Number: 6594021 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+shortest paths
@@ Property / zbMATH Keywords: shortest paths / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+chordal bipartite graphs
@@ Property / zbMATH Keywords: chordal bipartite graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+strongly chordal graphs
@@ Property / zbMATH Keywords: strongly chordal graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph algorithms
@@ Property / zbMATH Keywords: graph algorithms / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Algorithm 97
@@ Property / describes a project that uses: Algorithm 97 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+All-pairs-shortest-length on strongly chordal graphs
+Normal rank
@@ Property / cites work @@
+Solving the shortest-paths problem on bipartite permutation graphs efficiently
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281631
@@ Property / cites work: Q4281631 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of strongly chordal graphs
@@ Property / cites work: Characterizations of strongly chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Totally-Balanced and Greedy Matrices
@@ Property / cites work: Totally-Balanced and Greedy Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Shortest Paths in Sparse Networks
+Normal rank
@@ Property / cites work @@
+Doubly Lexical Orderings of Matrices
@@ Property / cites work: Doubly Lexical Orderings of Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Q4887753
@@ Property / cites work: Q4887753 / rank @@
+Normal rank
@@ Property / cites work @@
+Three Partition Refinement Algorithms
@@ Property / cites work: Three Partition Refinement Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm to solve the all-pair shortest path problem on interval graphs
+Normal rank
@@ Property / cites work @@
+On the all-pairs-shortest-path problem in unweighted undirected graphs.
+Normal rank
@@ Property / cites work @@
+Doubly lexical ordering of dense 0--1 matrices
@@ Property / cites work: Doubly lexical ordering of dense 0--1 matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
+Normal rank
@@ Property / OpenAlex ID @@
+W2135039026
@@ Property / OpenAlex ID: W2135039026 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:294620