On co-bicliques

Denis Cornaz

The search session has expired. Please query the service again.

Displaying similar documents to “On co-bicliques”

Acyclic chromatic index of a graph with maximum valency three

Jozef Fiamčík (1980)

Archivum Mathematicum

Similarity:

Characterizing families of cuts that can be represented by axis-parallel rectangles.

Brandes, Ulrik, Cornelsen, Sabine, Wagner, Dorothea (2005)

Journal of Graph Algorithms and Applications

Similarity:

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

Acyclic chromatic index of a subdivided graph

Jozef Fiamčík (1984)

Archivum Mathematicum

Similarity:

Drawing planar graphs with large vertices and thick edges.

Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)

Journal of Graph Algorithms and Applications

Similarity:

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

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.