6740 search results - page 501 / 1348 » An s -Hamiltonian Line Graph Problem |
185
click to vote
SIBGRAPI
2005
IEEE
16 years 14 days ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
206
click to vote
HPCC
2005
Springer
16 years 12 days ago
2005
Springer
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
188
click to vote
PARLE
1987
15 years 10 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
187
click to vote
DAM
2010
15 years 7 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
170
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...