5889 search results - page 222 / 1178 » Graph Layout Problems |
166
click to vote
MFCS
2004
Springer
15 years 12 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...
189
click to vote
WG
2004
Springer
15 years 12 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
157
click to vote
SWAT
1994
Springer
15 years 10 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...
128
click to vote
SWAT
1992
Springer
15 years 10 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.
135
click to vote
APPML
2008
15 years 6 months ago
2008
In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimiz...