5473 search results - page 50 / 1095 » On the graph isomorphism problem |
107
click to vote
CIAC
2010
Springer
14 years 8 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
ALGORITHMICA
2008
14 years 12 months ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
CADE
2006
Springer
16 years 4 days ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
131
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
JCO
2000
14 years 11 months ago
2000
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0