61 search results - page 8 / 13 » Embedding Graphs Containing K5-Subdivisions |
239
click to vote
DLIB
2002
15 years 5 months ago
2002
In this article we present a method for retrieving documents from a digital library through a visual interface based on automatically generated concepts. We used a vocabulary gene...
176
click to vote
ALGOSENSORS
2004
Springer
15 years 11 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
142
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
189
Voted
STACS
2010
Springer
16 years 20 days ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
161
click to vote
EJC
2010
15 years 5 months ago
2010
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...