286 search results - page 1 / 58 » Recognition Algorithm for Diamond-Free Graphs |
INFORMATICALT
2007
13 years 4 months ago
2007
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
DAM
2011
12 years 11 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
CAIP
2009
Springer
13 years 11 months ago
2009
Springer
GBRPR
2009
Springer
13 years 11 months ago
2009
Springer
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
FAW
2007
Springer
13 years 10 months ago
2007
Springer
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...