6740 search results - page 266 / 1348 » An s -Hamiltonian Line Graph Problem |
111
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
109
click to vote
ICALP
1990
Springer
15 years 4 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
93
Voted
PPSN
2000
Springer
15 years 4 months ago
2000
Springer
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
106
Voted
SAC
2004
ACM
15 years 6 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
126
Voted
ICGA
1993
15 years 2 months ago
1993
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...