An exact performance bound for an time greedy matching procedure.
Shapira, Andrew (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Shapira, Andrew (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Feuerstein, Esteban, Marchetti-Spaccamela, Alberto (1998)
Journal of Graph Algorithms and Applications
Similarity:
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...
Phillip G. Bradford, David A. Thomas (2009)
RAIRO - Theoretical Informatics and Applications
Similarity:
This paper gives a shortest path algorithm for CFG (context free grammar) labeled and weighted digraphs where edge weights may be positive or negative, but negative-weight cycles are not allowed in the underlying unlabeled graph. These results build directly on an algorithm of Barrett [ (2000) 809–837]. In addition to many other results, they gave a shortest path algorithm for CFG labeled and weighted digraphs where all edges are nonnegative. Our algorithm is based...
Morgan, Kerri, Farr, Graham (2007)
Journal of Graph Algorithms and Applications
Similarity:
Bar-Yehuda, Reuven, Yavneh, Irad (2006)
Journal of Graph Algorithms and Applications
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...
Suderman, Matthew, Whitesides, Sue (2005)
Journal of Graph Algorithms and Applications
Similarity:
Robertson, Neil, Seymour, P.D., Thomas, Robin (1999)
Annals of Mathematics. Second Series
Similarity:
Hartvigsen, David (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Janvresse, É., de la Rue, T., Velenik, Y. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: