6740 search results - page 446 / 1348 » An s -Hamiltonian Line Graph Problem |
184
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
186
click to vote
PC
2010
15 years 5 months ago
2010
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
200
click to vote
SSDBM
2010
IEEE
15 years 5 months ago
2010
IEEE
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
206
click to vote
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
166
click to vote
JCT
2010
15 years 1 months ago
2010
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...