241 search results - page 2 / 49 » Graphs, Hypergraphs and Hashing |
WG
1993
Springer
13 years 8 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
TAGT
1998
Springer
13 years 9 months ago
1998
Springer
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concep...
ICAPR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The aim of this paper is to present an improvement of a previously published algorithm. The proposed approach is performed in two steps. In the first step, we generate t...
CAIP
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...
ARSCOM
2004
13 years 4 months ago
2004
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...