2294 search results - page 55 / 459 » From Path Graphs to Directed Path Graphs |
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
ICCV
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
ICDAR
2005
IEEE
15 years 3 months ago
2005
IEEE
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
104
click to vote
FPGA
1995
ACM
15 years 1 months ago
1995
ACM
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...