Greedy Methods for Approximate Graph Matching with Applications for Social Network Analysis
In this thesis, we study greedy algorithms for approximate sub-graph matching with attributed graphs. Such algorithms find one or multiple copies of a sub-graph pattern from a bigger data graph through approximate matching. One intended application of sub-graph matching method is in Social Network A...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
LSU
2009
|
| Subjects: | |
| Online Access: | http://etd.lsu.edu/docs/available/etd-04132009-134102/ |