Algorithm and experiments in testing planar graphs for isomorphism.

Kukluk, Jacek P.; Holder, Lawrence B.; Cook, Diane J.

Displaying similar documents to “Algorithm and experiments in testing planar graphs for isomorphism.”

On identifying codes in the King grid that are robust against edge deletions.

Honkala, Iiro, Laihonen, Tero (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A novel approach for detection and elimination of automorphic graphs in graph databases.

Vijayalakshmi, R., Nadarajan, R., Nirmala, P., Thilaga, M. (2010)

International Journal of Open Problems in Computer Science and Mathematics. IJOPCM

Similarity:

Gray codes in graphs

Martin Knor (1994)

Mathematica Slovaca

Similarity:

Symmetric flows and broadcasting in hypercubes

Jean-Claude Bermond, A. Bonnecaze, T. Kodate, Stéphane Pérennes, Patrick Solé (1999)

Annales de l'institut Fourier

Similarity:

In this paper, we propose a method which enables to construct almost optimal broadcast schemes on an $n$ -dimensional hypercube in the circuit switched, $Δ$ -port model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary codes having the property that each code can inform the next one in a single round. This last property...