Sciweavers

1097 search results - page 35 / 220
» Testing Graph Isomorphism
Sort
View
COMBINATORICS
1998
103views more  COMBINATORICS 1998»
14 years 9 months ago
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
Mikhail E. Muzychuk, Gottfried Tinhofer
GG
2004
Springer
15 years 3 months ago
Fundamental Theory for Typed Attributed Graph Transformation
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
Hartmut Ehrig, Ulrike Prange, Gabriele Taentzer
CW
2002
IEEE
15 years 2 months ago
Topological Morphing Using Reeb Graphs
Metamorphosis between 3D objects is often the transformation between a pair of shapes that have the same topology. This paper presents a new model using Reeb graphs and their cont...
Pizzanu Kanonchayos, Tomoyuki Nishita, Yoshihisa S...
PVLDB
2010
129views more  PVLDB 2010»
14 years 8 months ago
Graph Pattern Matching: From Intractable to Polynomial Time
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
EJC
2002
14 years 9 months ago
On the Natural Imprint Function of a Graph
A subgraph H of a graph G is gated if for every x V(G) there exists a vertex u in H such that dG (x, v) = dG (x, u) + d G (u, v) for any v V(H). The gated amalgam of graphs G 1 an...
Bostjan Bresar