6740 search results - page 331 / 1348 » An s -Hamiltonian Line Graph Problem |
139
click to vote
PVLDB
2010
15 years 2 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
136
click to vote
NHM
2010
14 years 11 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
125
click to vote
ATMOS
2010
15 years 3 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
151
click to vote
CSR
2009
Springer
15 years 11 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
126
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...