4865 search results - page 265 / 973 » The Complexity of Graph Connectivity |
182
click to vote
WICON
2008
15 years 8 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
153
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
219
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
185
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
155
click to vote
IPL
2006
15 years 6 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing