6740 search results - page 268 / 1348 » An s -Hamiltonian Line Graph Problem |
97
Voted
4OR
2007
15 years 29 days ago
2007
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
105
click to vote
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
120
click to vote
WG
2004
Springer
15 years 6 months ago
2004
Springer
We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H = K3
95
Voted
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
81
Voted
SWAT
1992
Springer
15 years 4 months ago
1992
Springer
We obtain the rst NC algorithm for the low-diameter graph decomposition problem on arbitrary graphs. Our algorithm runs in O(log5 (n)) time, and uses O(n2) processors.