ARTÍCULO
TITULO

A Linear-Time Algorithm for Computing K-Terminal Reliability on Proper Interval Graphs

Lin    
M.-S.    

Resumen

No disponible

 Artículos similares

       
 
Larissa Zaira Rafael Rolim and Francisco de Assis de Souza Filho    
Improved water resource management relies on accurate analyses of the past dynamics of hydrological variables. The presence of low-frequency structures in hydrologic time series is an important feature. It can modify the probability of extreme events occ... ver más
Revista: Water

 
Fabian Gärtner and Peter F. Stadler    
Superbubbles are a class of induced subgraphs in digraphs that play an essential role in assembly algorithms for high-throughput sequencing data. They are connected with the remainder of the host digraph by a single entrance and a single exit vertex. Lin... ver más
Revista: Algorithms

 
Sukhpal Singh Ghuman, Emanuele Giaquinta and Jorma Tarhio    
We present two modifications of Duval?s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it is able to skip ... ver más
Revista: Algorithms

 
Frank Gurski, Dominique Komander and Carolin Rehs    
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph ??=(??,... ver más
Revista: Algorithms

 
Jyoti Mor,Naresh Kumar,Dinesh Rai    
The web is changing momentarily which makes it very difficult for the user to retrieve relevant results as per the given query. Clustering is a technique to organize search results in a way so that same search results are associated only with one cluster... ver más