๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithms for interval catch digraphs

โœ Scribed by Erich Prisner

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
832 KB
Volume
51
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A characterization of interval catch dig
A characterization of interval catch digraphs
โœ Erich Prisner ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 442 KB

It is shown that a (finite or infinite) digraph D is the catch digraph of a family of pointed intervals if and only if it contains no set of three vertices which Wail: any two of them are weakly connected by a chain where no initial endpoint of an arc precedes the third vertex. Furthermore, it is s

Short proofs for interval digraphs
Short proofs for interval digraphs
โœ Douglas B. West ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 327 KB

We give short proofs of the adjacency matrix characterizations of interval digraphs and unit interval digraphs.

A new algorithm for digraph isomorphism
A new algorithm for digraph isomorphism
โœ Narsingh Deo; J. M. Davis; R. E. Lord ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 976 KB
Interval models for target tracking algo
Interval models for target tracking algorithms
โœ Shan Cong; Lang Hong ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 643 KB

This paper presents a new set of models which utilize the target information implied by more than two scans of measurements. The new models are called interval models. Simulations prove that interval models have significant advantages over existing models in certain common scenarios.