6740 search results - page 96 / 1348 » An s -Hamiltonian Line Graph Problem |
131
click to vote
COR
2006
15 years 3 months ago
2006
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
131
click to vote
COMBINATORICA
2006
15 years 3 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
132
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
138
click to vote
ESA
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
129
click to vote
ICPP
2008
IEEE
15 years 9 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...