In one of the projects I've worked on, the subject of isomorphism versus monomorphism came up. A little background: I'm no expert on graph theory and have no formal training in it. But this topic is very important in chemistry, where chemists expect a particular kind of subgraph matching to take place in the structure search systems the...
I have a graph which contains an unknown number of disconnected subgraphs. What's a good algorithm (or Java library) to find them all? ...
How to obtain all the subgraphs of a fixed size from a graph, in pseudocode? (brute force) Without external libraries if possible. Thanks! ...
In the DOT language for GraphViz, I'm trying to represent a dependency diagram. I need to be able to have nodes inside a container and to be able to make nodes and/or containers dependent on other nodes and/or containers. I'm using subgraph to represent my containers. Node linking works just fine, but I can't figure out how to connect s...
Hello, I'm looking for an algorithm to check whether a given graph is subgraph of another given graph. I have few conditions to make this NP complete problem bit more feasible.. The graphs have approx <20 vertices. The graphs are DAG. All vertices are non-uniquely labeled, and the corresponding vertices in the main graph and the subg...
Subgraph isomorphism is an NP Complete problem. The most widely used algorithm is the one proposed by Ullman. Can someone please explain the algorithm to me in layman's language? I read the above paper by him, but couldn't understand much. What other algorithms exist for this problem? I am working on an image processing project. ...
I have an graph with the following attributes: Undirected Not weighted Each vertex has a minimum of 2 and maximum of 6 edges connected to it. Vertex count will be < 100 Graph is static and no vertices/edges can be added/removed or edited. I'm looking for paths between a random subset of the vertices (at least 2). The paths should s...
Is there a known algorithm or method to find all complete sub-graphs within a graph? I have an undirected, unweighted graph and I need to find all subgraphs within it where each node in the subgraph is connected to each other node in the subgraph. Is there an existing algorithm for this? ...
Hello I was wondering if anyone knows about a solution to the following problem: Given a graph g as query and a set of graphs B with connection rules R. The connection rules describe how two graphs out of B can be linked together. Linking points are marked vertexes. Find all combination of graphs in B that contain g as a subgraph. Reg...
I have an unweighted, connected graph. I want to find a connected subgraph that definitely includes a certain set of nodes, and as few extras as possible. How could this be accomplished? Just in case, I'll restate the question using more precise language. Let G(V,E) be an unweighted, undirected, connected graph. Let N be some subset...