Experiments with the fixed-parameter approach for two-layer planarization.

Suderman, Matthew; Whitesides, Sue

Displaying similar documents to “Experiments with the fixed-parameter approach for two-layer planarization.”

Subgraph isomorphism in planar graphs and related problems.

Eppstein, David (1999)

Journal of Graph Algorithms and Applications

Similarity:

I/O-optimal algorithms for outerplanar graphs.

Maheshwari, Anil, Zeh, Norbert (2004)

Journal of Graph Algorithms and Applications

Similarity:

On external-memory planar depth first search.

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

Journal of Graph Algorithms and Applications

Similarity:

Heuristic and metaheuristic methods for computing graph treewidth

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

An efficient implementation of Sugiyama's algorithm for layered graph drawing.

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

Journal of Graph Algorithms and Applications

Similarity:

An exact performance bound for an $O (m + n)$ time greedy matching procedure.

Shapira, Andrew (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Two-layer planarization: improving on parameterized algorithmics.

Fernau, Henning (2005)

Journal of Graph Algorithms and Applications

Similarity:

Theorem proving through depth-first test

Zsolt Tuza (1992)

Acta Universitatis Carolinae. Mathematica et Physica

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

Straight-line drawings on restricted integer grids in two and three dimensions.

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

Journal of Graph Algorithms and Applications

Similarity: