183 search results - page 1 / 37 » On the Matching Problem for Special Graph Classes |
COCO
2010
Springer
13 years 8 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
JSAT
2008
13 years 10 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
JCT
2007
13 years 10 months ago
2007
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
STACS
1994
Springer
14 years 2 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
EVOW
2006
Springer
14 years 2 months ago
2006
Springer
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...