1327 search results - page 108 / 266 » Path following algorithm for the graph matching problem |
179
click to vote
DAM
2007
15 years 6 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
194
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
198
click to vote
SWAT
2004
Springer
16 years 3 days ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
218
click to vote
PVLDB
2008
15 years 5 months ago
2008
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
189
Voted
TAMC
2009
Springer
16 years 1 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...