Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph |
scientific article; zbMATH DE number 985026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph |
scientific article; zbMATH DE number 985026 |
Statements
Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (English)
0 references
28 February 1997
0 references
Design of algorithms
0 references
Efficient algorithms
0 references
Chordal bipartite graphs
0 references
0.8289707899093628
0 references
0.8017624020576477
0 references
0.7867658138275146
0 references
