Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs (Q6487434)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7645878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs |
scientific article; zbMATH DE number 7645878 |
Statements
Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs (English)
0 references
25 January 2023
0 references
0.8289707899093628
0 references
0.8066855669021606
0 references
0.7992013692855835
0 references
0.7992013692855835
0 references
