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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-pairs-shortest-length on strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the shortest-paths problem on bipartite permutation graphs efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally-Balanced and Greedy Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Shortest Paths in Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Lexical Orderings of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to solve the all-pair shortest path problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the all-pairs-shortest-path problem in unweighted undirected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly lexical ordering of dense 0--1 matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135039026 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:26, 4 December 2024

scientific article
Language Label Description Also known as
English
Solving the all-pairs-shortest-length problem on chordal bipartite graphs
scientific article

    Statements

    Solving the all-pairs-shortest-length problem on chordal bipartite graphs (English)
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    shortest paths
    0 references
    chordal bipartite graphs
    0 references
    strongly chordal graphs
    0 references
    graph algorithms
    0 references

    Identifiers