AN ALGORITHM FOR FINDING A MAXIMUM CYCLE OF BIPARTITE GRAPHS WITH LARGE DEGREES (Q3126015): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:52, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | AN ALGORITHM FOR FINDING A MAXIMUM CYCLE OF BIPARTITE GRAPHS WITH LARGE DEGREES |
scientific article |
Statements
AN ALGORITHM FOR FINDING A MAXIMUM CYCLE OF BIPARTITE GRAPHS WITH LARGE DEGREES (English)
0 references
23 March 1997
0 references
bipartite graph
0 references
Hamiltonian cycle
0 references
