home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.theory
- Path: sparky!uunet!microsoft!hexnut!bobatk
- From: bobatk@microsoft.com (Bob Atkinson)
- Subject: Wanted: alg for "is G1 a subgraph of G2"
- Message-ID: <1992Dec21.230436.17820@microsoft.com>
- Date: 21 Dec 92 23:04:36 GMT
- Organization: Microsoft Corporation
- Lines: 28
-
- I have run across the need the need for efficient algorithms for determining
- if a given colored directed graph is a subgraph of a second colored directed
- graph. If it makes a difference, I expect roughly the following problem
- characteristics:
-
- 1) the out-degree of each node tends to be small, on
- the order of ten or so.
- 2) the in-degree of each node is almost always one,
- though there are exceptions.
- 3) the number of colors with which nodes are painted
- is on the order of tens of thousands
- 4) the query graph (the first) has tens of nodes,
- while the target graph may have thousands.
- 5) both graphs are very often acyclic. Possibly, I could
- require that this be so, if that were to make an
- otherwise intractable problem tractable.
-
- In addition, I am also interested in the related problem where the edges of the graph are labeled. Here I expect that there are
-
- 6) on the order of 25 or so distinct edge labels
-
- Can anyone point me towards some likely leads?
-
- Thank you very much.
-
- Bob Atkinson
- Microsoft Corporation
- 206-936-5570, BobAtk@Microsoft.Com
-