286 search results - page 8 / 58 » Recognition Algorithm for Diamond-Free Graphs |
109
click to vote
GBRPR
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
108
Voted
WG
2005
Springer
15 years 7 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
115
click to vote
DAC
2001
ACM
16 years 2 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 ...
90
Voted
CAIP
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper, we introduce a prototype-based clustering algorithm dealing with graphs. We propose a hypergraph-based model for graph data sets by allowing clusters overl...
109
click to vote
GBRPR
2007
Springer
15 years 8 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 ...