Displaying similar documents to “Maximum cardinality 1-restricted simple 2-matchings.”

The Capacitated Arc Routing Problem. A heuristic algorithm.

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...

Perfectly matchable subgraph problem on a bipartite graph

Firdovsi Sharifov (2010)

RAIRO - Operations Research

Similarity:

We consider the maximum weight perfectly matchable subgraph problem on a bipartite graph with respect to given nonnegative weights of its edges. We show that has a perfect matching if and only if some vector indexed by the nodes in is a base of an extended polymatroid associated with a submodular function defined on the subsets of . The dual problem of the separation problem for the extended polymatroid is transformed to the special maximum flow problem on . In this paper, we give...

Labeled shortest paths in digraphs with negative and positive edge weights

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...

Some graphic uses of an even number of odd nodes

Kathie Cameron, Jack Edmonds (1999)

Annales de l'institut Fourier

Similarity:

Vertex-degree parity in large implicit “exchange graphs” implies some EP theorems asserting the existence of a second object without evidently providing a polytime algorithm for finding a second object.

The edge domination problem

Shiow-Fen Hwang, Gerard J. Chang (1995)

Discussiones Mathematicae Graph Theory

Similarity:

An edge dominating set of a graph is a set D of edges such that every edge not in D is adjacent to at least one edge in D. In this paper we present a linear time algorithm for finding a minimum edge dominating set of a block graph.