43 search results - page 6 / 9 » Polynomial time recognition of unit circular-arc graphs |
154
click to vote
JGT
2006
15 years 8 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
218
click to vote
GBRPR
2007
Springer
16 years 2 months ago
2007
Springer
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
187
click to vote
DAC
2001
ACM
16 years 9 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
225
Voted
SSPR
2004
Springer
16 years 1 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
215
click to vote
ESA
2005
Springer
16 years 1 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...