Sciweavers

3204 search results - page 69 / 641
» The Alcuin Number of a Graph
Sort
View
FUN
2010
Springer
285views Algorithms» more  FUN 2010»
14 years 25 days ago
An Algorithmic Analysis of the Honey-Bee Game
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
Rudolf Fleischer, Gerhard J. Woeginger
PPL
2000
91views more  PPL 2000»
13 years 7 months ago
A Parallel Algorithm for Planar Orthogonal Grid Drawings
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
GBRPR
2007
Springer
14 years 2 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
DAM
1999
128views more  DAM 1999»
13 years 7 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
BIRTHDAY
2005
Springer
14 years 1 months ago
Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
Claudia Ermel, Gabriele Taentzer, Roswitha Bardohl