Comparability Graphs and Digital Topology

descriptionPublicationkeyboard_double_arrow_right Article 01 Apr 2001 English Publisher:Elsevier BVJournal:Computer Vision and Image Understanding, volume 82, pages 33-41 (issn: 1077-3142,

Copyright policy )

Authors: Alain Bretto;

doi: 10.1006/cviu.2000.0901

Comparability Graphs and Digital Topology

- Summary
- Subjects
- Metrics

Abstract

Summary: \textit{D. Nogy} and \textit{M. Schladt} [Comput. Vis. Graphics Image Process. Image Understand. 63, 394-396 (1996)] as well as \textit{L. Lateki} [Comput. Vis. Graphics Image Process. Image Understand. 57, 261-262 (1993)] deal with the topology on graphs. In this note, using a theorem given by \textit{P. Prea} [Discrete Math. 103, 189-197 (1992; Zbl 0757.05050)], we will give new, simpler and shorter proofs of these results, we will generalize some of them.

Related Organizations

Jean Monnet University
France
A K Industries (United Kingdom)
United Kingdom

Keywords

Computer graphics; computational geometry (digital and algorithmic aspects)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	11
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%