AN ALGORITHM FOR FINDING A MAXIMUM CYCLE OF BIPARTITE GRAPHS WITH LARGE DEGREES
From MaRDI portal
Publication:3126015
DOI10.1142/S012905419600021XzbMath0867.68088MaRDI QIDQ3126015
Publication date: 23 March 1997
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905419600021x
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
Related Items