9842 search results - page 292 / 1969 » The Complexity of the Matching-Cut Problem |
135
Voted
WABI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
137
Voted
MOBIHOC
2006
ACM
16 years 3 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
115
click to vote
CCA
2009
Springer
15 years 10 months ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
138
Voted
GI
2007
Springer
15 years 9 months ago
2007
Springer
: State-of-the-art interoperability between heterogeneous systems on a technical level builds on services oriented architectures (SOA) for a given problem space. Semantics can be i...
152
Voted
TAMC
2009
Springer
15 years 8 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...