Tibor Dudás

From MaRDI portal
Person:1356407

Available identifiers

zbMath Open dudas.tiborMaRDI QIDQ1356407

List of research outcomes





PublicationDate of PublicationType
The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices1999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q43946001998-06-11Paper
https://portal.mardi4nfdi.de/entity/Q43696311998-01-05Paper
Spanning trees and shortest paths in Monge graphs1998-01-01Paper
The computational complexity of Steiner tree problems in graded matrices1997-12-09Paper
https://portal.mardi4nfdi.de/entity/Q43631631997-11-13Paper
Cut and patch Steiner trees for ladders1997-06-09Paper

Research outcomes over time

This page was built for person: Tibor Dudás

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:1356407&oldid=11090168"
Powered by MediaWiki