### Subgraph isomorphism in planar graphs and related problems.

Eppstein, David (1999)

Journal of Graph Algorithms and Applications

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Eppstein, David (1999)

Journal of Graph Algorithms and Applications

Similarity:

Maheshwari, Anil, Zeh, Norbert (2004)

Journal of Graph Algorithms and Applications

Similarity:

Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert (2003)

Journal of Graph Algorithms and Applications

Similarity:

François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier (2004)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, several studies have shown that the tree-decomposition method can be used to solve many basic optimization problems in polynomial time when treewidth is bounded, even if, for arbitrary graphs, computing the treewidth is NP-hard. Several papers present heuristics with computational experiments. For many graphs the discrepancy between the heuristic results and the best lower bounds is still very...

Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)

Journal of Graph Algorithms and Applications

Similarity:

Shapira, Andrew (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Fernau, Henning (2005)

Journal of Graph Algorithms and Applications

Similarity:

Zsolt Tuza (1992)

Acta Universitatis Carolinae. Mathematica et Physica

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

Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen (2003)

Journal of Graph Algorithms and Applications

Similarity:

Morgan, Kerri, Farr, Graham (2007)

Journal of Graph Algorithms and Applications

Similarity: