Sciweavers

5473 search results - page 14 / 1095
» On the graph isomorphism problem
Sort
View
FAW
2007
Springer
115views Algorithms» more  FAW 2007»
14 years 5 months ago
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs
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...
Stavros D. Nikolopoulos, Leonidas Palios
SIGMOD
2010
ACM
274views Database» more  SIGMOD 2010»
14 years 3 months ago
K-isomorphism: privacy preserving network publication against structural attacks
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
James Cheng, Ada Wai-Chee Fu, Jia Liu
KGC
1997
Springer
14 years 3 months ago
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization
The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic t...
Samuel R. Buss
JCT
2008
68views more  JCT 2008»
13 years 11 months ago
Pseudo 2-factor isomorphic regular bipartite graphs
A graph is pseudo 2
Marien Abreu, A. A. Diwan, Bill Jackson, Domenico ...
DAM
2010
81views more  DAM 2010»
13 years 11 months ago
The k-in-a-tree problem for graphs of girth at least k
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
W. Liu, Nicolas Trotignon