Sciweavers

23 search results - page 3 / 5
» cocoon 2008
Sort
View
COCOON
2008
Springer
13 years 8 months ago
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
Xianchao Zhang, Weifa Liang, Guoliang Chen
COCOON
2008
Springer
13 years 8 months ago
Probe Ptolemaic Graphs
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
David B. Chandler, Maw-Shang Chang, Ton Kloks, Van...
COCOON
2008
Springer
13 years 8 months ago
On the Complexity of Equilibria Problems in Angel-Daemon Games
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
Joaquim Gabarró, Alina García, Maria...
COCOON
2008
Springer
13 years 8 months ago
Spectrum Bidding in Wireless Networks and Related
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
Xiang-Yang Li, Ping Xu, ShaoJie Tang, Xiaowen Chu
COCOON
2008
Springer
13 years 8 months ago
Sequence Alignment Algorithms for Run-Length-Encoded Strings
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) s...
Guan-Shieng Huang, Jia Jie Liu, Yue-Li Wang