6740 search results - page 366 / 1348 » An s -Hamiltonian Line Graph Problem |
151
click to vote
QSHINE
2005
IEEE
15 years 10 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
140
click to vote
PAM
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
135
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
171
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
166
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...