Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
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
16 June 2016
0 references
shortest paths
0 references
chordal bipartite graphs
0 references
strongly chordal graphs
0 references
graph algorithms
0 references
