The UvA-LINKER will give you a range of other options to find the full text of a publication (including a direct link to the full-text if it is located on another database on the internet).
De UvA-LINKER biedt mogelijkheden om een publicatie elders te vinden (inclusief een directe link naar de publicatie online als deze beschikbaar is in een database op het internet).


Zoekopdracht: faculteit: "FEB" en publicatiejaar: "2004"

AuteursA. Volgenant, C.W. Duin
TitelOn Steiner versions of (bi)connectivity in network problems
TijdschriftGraphs and Combinatorics
FaculteitFaculteit Economie en Bedrijfskunde
Instituut/afd.FEB: Amsterdam School of Economics Research Institute (ASE-RI)
SamenvattingThe notions of connectivity and biconnectivity can be generalized in the Steiner sense, i.e., they are restricted to a given subset of the vertices of a graph. We illustrate this generalization on two problems. The first problem is the bottleneck biconnected subgraph problem, the second one is the so-called bipartition problem. The adapted algorithms to solve the Steiner versions of these problems exploit depth-first search to attain respectively a running time of O(|E|+|V|log|V|) and O(|E|+|V|) with E denoting the set of edges and V the set of vertices of the given graph.
Soort documentArtikel
Document finderUvA-Linker