List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices Computers & Mathematics with Applications | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1163111 (Why is no real title available?) | 1998-06-11 | Paper |
| scientific article; zbMATH DE number 1099658 (Why is no real title available?) | 1998-01-05 | Paper |
| Spanning trees and shortest paths in Monge graphs Computing | 1998-01-01 | Paper |
| The computational complexity of Steiner tree problems in graded matrices Applied Mathematics Letters | 1997-12-09 | Paper |
| scientific article; zbMATH DE number 1086908 (Why is no real title available?) | 1997-11-13 | Paper |
| Cut and patch Steiner trees for ladders Discrete Mathematics | 1997-06-09 | Paper |
Research outcomes over time
This page was built for person: Tibor Dudás
