Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
The system of Peirce’s existential graphs is a diagrammatic version of first order logic. To be more precisely: As Peirce wanted to develop a logic of relatives (i.e., relations...
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...