6740 search results - page 292 / 1348 » An s -Hamiltonian Line Graph Problem |
124
click to vote
EJC
2008
15 years 4 months ago
2008
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
136
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
152
Voted
JCT
2008
15 years 3 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
135
Voted
ICPP
2006
IEEE
15 years 10 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
126
click to vote
CN
2007
15 years 3 months ago
2007
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...