6740 search results - page 259 / 1348 » An s -Hamiltonian Line Graph Problem |
93
Voted
CGF
2005
15 years 3 months ago
2005
We introduce a new texture representation that combines standard sampling, to be bilinearly interpolated in smoothly varying regions, with customizable discontinuities, to model s...
132
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
123
Voted
WG
2010
Springer
15 years 2 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
128
Voted
GD
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
160
Voted
COMBINATORICA
2010
14 years 10 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...