AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS (Q5249271): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054101000588 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2138166588 / rank | |||
Normal rank | |||
Latest revision as of 09:35, 30 July 2024
scientific article; zbMATH DE number 6432495
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS |
scientific article; zbMATH DE number 6432495 |
Statements
AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS (English)
0 references
30 April 2015
0 references
bipartite graph
0 references
even path
0 references
Hamiltonian cycle
0 references
distance
0 references
degree
0 references
adjacency list
0 references
unextendable vertex
0 references
