Sciweavers

1162 search results - page 59 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
WG
2009
Springer
14 years 2 months ago
Sub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmara...
EVOW
2006
Springer
14 years 16 hour ago
A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
Olfa Sammoud, Sébastien Sorlin, Christine S...
PVLDB
2008
108views more  PVLDB 2008»
13 years 7 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
ICPPW
2006
IEEE
14 years 2 months ago
Grid Resource Allocation and Task Scheduling for Resource Intensive Applications
Evolution of grid has drawn attention from various resource intensive applications addressing domains of bio-informatics, astrology and multimedia, to name a few. Image analysis a...
Abdul Aziz, Hesham El-Rewini