212 search results - page 26 / 43 » Subgraph Isomorphism in Planar Graphs and Related Problems |
AGTIVE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
IPL
2006
14 years 9 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
APIN
2006
14 years 10 months ago
2006
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...
KAIS
2010
14 years 8 months ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...