Geometric symmetry in graphs
Graph drawing by force-directed placement
Software—Practice & Experience
The complexity of subgraph isomorphism for classes of partial k-trees
Theoretical Computer Science
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Enumerating all connected maximal common subgraphs in two graphs
Theoretical Computer Science
Spring algorithms and symmetry
Theoretical Computer Science - computing and combinatorics
Symmetric drawings of triconnected planar graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computational Complexity of Geometric Symmetry Detection in Graphs
Proceedings of the The First Great Lakes Computer Science Conference on Computing in the 90's
Validating Graph Drawing Aesthetics
GD '95 Proceedings of the Symposium on Graph Drawing
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Graph Multidrawing: Finding Nice Drawings Without Defining Nice
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
On Maximum Symmetric Subgraphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
IEEE Transactions on Software Engineering
Canonical labelling of graphs in linear average time
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Partitioning and scheduling of task graphs on partially dynamically reconfigurable FPGAs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. Then the graph partitions into a large subgraph, its copy and a remainder. The problem resembles the NP-hard largest common subgraph problem. In [1,2] it has been shown that the isomorphic subgraph problem is NP-hard, even for restricted instances. In this paper we present a greedy heuristic for the approximation of large isomorphic subgraphs and introduce a spring algorithm which preserves isomorphic subgraphs and displays them as copies of each other. The heuristic has been tested extensively on four independent test suites. The drawing algorithm yields nice drawings which cannot be obtained by standard spring algorithms.