Algorithms for single link failure recovery and related problems.
Bhosle, Amit M., Gonzalez, Teofilo F. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Bhosle, Amit M., Gonzalez, Teofilo F. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Feuerstein, Esteban, Marchetti-Spaccamela, Alberto (1998)
Journal of Graph Algorithms and Applications
Similarity:
Hartvigsen, David (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Markov, Minko, Ionut Andreica, Mugurel, Manev, Krassimir, Tapus, Nicolae (2012)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): G.2.2. We propose an algorithm that computes the length of a longest path in a cactus graph. Our algorithm can easily be modified to output a longest path as well or to solve the problem on cacti with edge or vertex weights. The algorithm works on rooted cacti and assigns to each vertex a two-number label, the first number being the desired parameter of the subcactus rooted at that vertex. The algorithm applies the divide-and-conquer...
Bar-Yehuda, Reuven, Yavneh, Irad (2006)
Journal of Graph Algorithms and Applications
Similarity:
C.P. Gopalakrishnan, C.R. Satyan, C. Pandu Rangan (1995)
Discussiones Mathematicae Graph Theory
Similarity:
Disjoint paths have applications in establishing bottleneck-free communication between processors in a network. The problem of finding minimum delay disjoint paths in a network directly reduces to the problem of finding the minimal disjoint paths in the graph which models the network. Previous results for this problem on chordal graphs were an O(|V| |E|²) algorithm for 2 edge disjoint paths and an O(|V| |E|) algorithm for 2 vertex disjoint paths. In this paper, we give an O(|V| |E|)...
Enrique. Benavent, V. Campos, Angel Corberán, Enrique Mota (1990)
Qüestiió
Similarity:
In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific vertex (the depot) and with a known capacity Q, must service a subset of the edges of the graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity. A heuristic algorithm for this problem is proposed consisting of: the selection of K centers, the construction of K connected graphs with associated loads...
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Beihoffer, Dale, Hendry, Jemimah, Nijenhuis, Albert, Wagon, Stan (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hans-Joachim Böckenhauer, Dirk Bongartz (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
The HP model is one of the most popular discretized models for attacking the protein folding problem, , for the computational prediction of the tertiary structure of a protein from its amino acid sequence. It is based on the assumption that interactions between hydrophobic amino acids are the main force in the folding process. Therefore, it distinguishes between polar and hydrophobic amino acids only and tries to embed the amino acid sequence into a two- or three-dimensional grid...
Eppstein, David (2007)
Journal of Graph Algorithms and Applications
Similarity: