Identifying structural similarity of methods using isomorphic graphs
Sim-Hui TeeAuthors Info & ClaimsAbstract
Reference
Index Terms
- Identifying structural similarity of methods using isomorphic graphs
Recommendations
Partitioning a graph into two pieces, each isomorphic to the other or to its complement
A simple graph G has the generalized-neighbour-closed-co-neighbour property, or is a gncc graph, if for all vertices x of G, the subgraph, induced by the set of neighbours of x, is isomorphic to the subgraph, induced by the set of non-neighbours of x, ...
Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs
A graph H is called a supersubdivison of a graph G if H is obtained from G by replacing every edge uv of G by a complete bipartite graph K2,m (m may vary for each edge) by identifying u and v with the two vertices in K2,m that form one of the two ...
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
AbstractWe investigate the enumeration problems for the class of distance-hereditary graphs and related graph classes. We first give an enumeration algorithm for the class of distance-hereditary graphs using the recent framework for enumerating every non-...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 107Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in