Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph |
scientific article |
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
