882 search results - page 40 / 177 » On the Hardness of Graph Isomorphism |
JCSS
2011
13 years 3 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
COMBINATORICS
2006
13 years 9 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
DAM
2008
13 years 9 months ago
2008
For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
FUZZIEEE
2007
IEEE
14 years 3 months ago
2007
IEEE
— The algebra of truth values of type-2 fuzzy sets contains isomorphic copies of the algebra of truth values of type1 fuzzy sets and the algebra of truth values of interval-value...