Faster algorithms for Frobenius numbers.
Beihoffer, Dale, Hendry, Jemimah, Nijenhuis, Albert, Wagon, Stan (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Beihoffer, Dale, Hendry, Jemimah, Nijenhuis, Albert, Wagon, Stan (2005)
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...
Martinovic, Goran, Aleksi, Ivan, Baumgartner, Alfonzo (2008)
Mathematical Problems in Engineering
Similarity:
Feuerstein, Esteban, Marchetti-Spaccamela, Alberto (1998)
Journal of Graph Algorithms and Applications
Similarity:
Rahim A. Abbaspour, Farhad Samadzadegan (2010)
Computer Science and Information Systems
Similarity:
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Georgiadis, Loukas, Tarjan, Robert E., Werneck, Renato F. (2006)
Journal of Graph Algorithms and Applications
Similarity:
Bruno Escoffier, Vangelis Th. Paschos (2006)
RAIRO - Operations Research
Similarity:
In on-line computation, the instance of the problem dealt is not entirely known from the beginning of the solution process, but it is revealed step-by-step. In this paper we deal with on-line independent set. On-line models studied until now for this problem suppose that the input graph is initially empty and revealed either vertex-by-vertex, or cluster-by-cluster. Here we present a new on-line model quite different to the ones already studied. It assumes that a superset of the final...
T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...
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|)...
J. Maublanc, D. Peyrton, A. Quilliot (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.
Silvana Petruseva (2006)
The Yugoslav Journal of Operations Research
Similarity:
Morgan, Kerri, Farr, Graham (2007)
Journal of Graph Algorithms and Applications
Similarity:
Dragoš Cvetković, Milan Milosavljević, Vladimir Dimitrijević (1991)
The Yugoslav Journal of Operations Research
Similarity: