Sciweavers

17 search results - page 3 / 4
» A note on disjoint arborescences
Sort
View
ARSCOM
2002
70views more  ARSCOM 2002»
13 years 7 months ago
On the Number of Graphical Forest Partitions
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
Deborah A. Frank, Carla D. Savage, James A. Seller...
PAM
2007
Springer
14 years 1 months ago
Implications of Power Control in Wireless Networks: A Quantitative Study
Abstract. The use of power control in wireless networks can lead to two conflicting effects. An increase in the transmission power on a link may (i) improve the quality and thus t...
Ioannis Broustis, Jakob Eriksson, Srikanth V. Kris...
MST
2006
99views more  MST 2006»
13 years 7 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
JDM
1998
101views more  JDM 1998»
13 years 7 months ago
Fault-Tolerant Quorum Consensus Scheme for Replication Control in Mobile Distributed Database Systems
We propose a new replication control scheme for multiple-copy consistency in mobile distributed database systems. Replicating data at multiple sites could contribute to enhance th...
Siwoo Byun, Songchun Moon
ECCC
2007
147views more  ECCC 2007»
13 years 7 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...