Navigating clustered graphs using force-directed methods.
Neochromatica
We create and discuss several modifications to traditional graph coloring. In particular, we classify various notions of coloring in a proper hierarchy. We concentrate on grid graphs whose colorings can be represented by natural number entries in arrays with various restrictions.
New bounds for codes identifying vertices in graphs.
New results on generalized graph coloring.
Nombre de sauts et graphes série-parallèles
Nondeterminism versus determinism of finite automata over directed acyclic graphs.
NP-completeness of minimal width unordered tree layout.
NP-completeness of the planar separator problems.
NP-completeness results for minimum planar spanners.
NP-hardness results for intersection graphs
Numbering action vertices in workflow graphs
Workflow graphs, consisting of actions, events, and logical switches, are used to model business processes. In order to easily identify the actions within a workflow graph, it is useful to number them in such a way that the numbering reflects the structure of the workflow. However, available tools offer only rudimental numbering schemes. In the paper, a set of natural requirements is defined that a logical numbering should fulfill. It is investigated under what conditions there is an appropriate...
Numerical studies of the asymptotic height distribution in binary search trees.