On the succinct representation of graphs
✍ Scribed by György Turán
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 371 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Boolean automata are a generalization of finite automata in the sense that the 'next state'i i.e. the result of the transition function given a state and a letter, is not just a single state (deterministic automata) or a union of states (nondeterministic automata) but a boolean function of states. B
## Abstract An interval graph __G__ is homogeneously representable if for every vertex __v__ of __G__ there exists an interval representation of __G__ with __v__ corresponding to an end interval. We show that the homogeneous representation of interval graphs is rooted in a deeper property of a clas