4   Artículos

 
en línea
András Faragó and Zohre R. Mojaveri    
The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but various... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
András Faragó and Zohre R. Mojaveri    
In this survey paper, we review various concepts of graph density, as well as associated theorems and algorithms. Our goal is motivated by the fact that, in many applications, it is a key algorithmic task to extract a densest subgraph from an input graph... ver más
Revista: Algorithms    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »