6740 search results - page 75 / 1348 » An s -Hamiltonian Line Graph Problem |
EJC
2010
13 years 10 months ago
2010
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
TCOM
2010
13 years 8 months ago
2010
Abstract—To gradually expand their networks, operators deploy new xDSL technologies from remote terminals (RT’s) closer to the customer. However, since xDSL lines deployed from...
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
CORR
2002
Springer
13 years 10 months ago
2002
Springer
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
SPAA
2010
ACM
14 years 2 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...