On the algorithmics of higraphs (1997) [1 citations — 0 self]
Download:
|
|
by Ornit Grossman, David Harel
ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-15.ps.Z
Add To MetaCart
Abstract:
This paper initiates an algorithmic investigation of higraphs, a formalism proposed in 1988 that combines and extends graphs and Euler/Venn diagrams. We first provide higraphs with a syntax and semantics that minimize ambiguities in the interpretation. We then consider some basic properties of higraphs, such as shortest paths, Hamiltonian cycles, bipartition, and minimum cover, and seek algorithms to test for them. In some cases, like shortest paths, the algorithms and the bounds from graphs can be generalized to higraphs, but in others, such as Hamiltonian cycles, the situation is not as clear. 1
Citations
| 1713 | Statecharts: A Visual Formalism for Complex Systems – Harel - 1987 |
| 491 | On Visual Formalisms – Harel - 1988 |
| 437 | On the Formal Semantics of Statecharts – Harel, Pnueli, et al. - 1987 |
| 354 | Statemate: A working environment for the development of complex reactive systems – Harel - 1990 |
| 278 | Executable object modeling with statecharts – Harel, Gery - 1997 |
| 137 | Graphs and Algorithms – Gondran, Minoux - 1984 |
| 17 | 1881, Symbolic logic – Venn |
| 13 | On Statecharts with overlapping – Harel, Kahana - 1992 |
| 4 | Processing Visual Specifications of File System Security – Heydon - 1992 |
| 4 | Formal Semantics for Visual Specification of Security – Maimone, Tygar, et al. - 1990 |
| 1 | Representing Relations Diagrammatically", Working Papers on Diagrams and Logic – Hammer - 1993 |
