2125 search results - page 295 / 425 » On Graph Complexity |
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
109
click to vote
ICDAR
2003
IEEE
15 years 7 months ago
2003
IEEE
We are concerned with the extraction of tables from exchange format representations of very diverse composite documents. We put forward a flexible representation scheme for comple...
102
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
103
click to vote
ESA
2003
Springer
15 years 7 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...